4850 search results - page 190 / 970 » Proof and Computation in Geometry |
163
click to vote
MFCS
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
192
click to vote
COCO
2005
Springer
16 years 2 days ago
2005
Springer
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
139
click to vote
CRYPTO
2005
Springer
16 years 2 days ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
131
click to vote
MFCS
2005
Springer
16 years 17 hour ago
2005
Springer
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
191
click to vote
COCO
2004
Springer
15 years 12 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...