The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
On the power of multi-prover interactive protocols
Theoretical Computer Science
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Approximation algorithms for NP-hard problems
On slightly superlinear transparent proofs
On slightly superlinear transparent proofs
Probabilistic checking of proofs; a new characterization of NP
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs
Studies in complexity and cryptography
| Hi-index | 0.00 |
We reformulate the subject of holographic proof checking in terms of three-valued logic. In this reformulation the recursive proof checking idea of Arora and Safra gets an especially elegant form. Our approach gives a more concise and accurate treatment of the holographic proof theory, and yields easy to check proofs about holographic proofs. A consequence of our results is that for any Ɛ 0 MAX3SAT instances cannot be approximated in TIME(2n1-Ɛ) within a factor which tends to 1 when n tends to infinity, unless 3SAT can be solved in TIME(2n1-Ɛ) for some Ɛ 0.