3228 search results - page 107 / 646 » Computationally Sound Proofs |
STACS
2010
Springer
14 years 3 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
CSR
2006
Springer
14 years 19 days ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆0 n iff β is a ∆n-real. The special case where n is 1 is the independently inter...
LLC
2011
13 years 3 months ago
2011
Computational phonology studies sound patterns in the world’s languages from a computational perspective. This article shows that the similarities between different generative t...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...