1411 search results - page 6 / 283 » Interactive Coding for Interactive Proofs |
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
IANDC
2006
13 years 9 months ago
2006
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
COCO
2008
Springer
13 years 11 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
CEAS
2007
Springer
14 years 4 months ago
2007
Springer
We show how a game-theoretic model of spam e-mailing, which we had introduced in previous work, can be extended to include the possibility of employing Human Interactive Proofs (h...
CSL
2002
Springer
13 years 9 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...