Anne Condon
Joan Feigenbaum
- 1.S. Arora, C. Lund, 1#. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Hardness of Approximation Problems, Proc. 33rd Symposium on Foundations of Computer Science, IE, EE Computer Society Press, Los Alamitos, 1992, pp. 14- 23.Google Scholar
Digital Library
- 2.S. Arora and M. Safra, Probabilistic Checking of Proofs, Proc. 33rd Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1992, pp. 2-13.Google Scholar
- 3.L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking Computations in Polylogarithmic Time, Proc. 23rd Symposium on Theory of Computing, ACM, New York, 1991, pp. 21-31. Google ScholarDigital Library
- 4.L. Babai and S. Moran, Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes, J. Comput. System Sci., 36 (1988), pp. 254-276. Google ScholarDigital Library
- 5.E. Berlekamp and L. Welch, Error Correction of Algebraic Block Codes, US Patent Number 4,633,470. Appears in {10}.Google Scholar
- 6.A. Condon, j. Feigenbaum, C. Lund, and P. Shot, Probabilistically Checkable Debate Systems and Approximation Algorithms for PSPACE- Hard Functions, AT#T Bell Laboratories Technical Memorandum, January 12, 1993.Google Scholar
- 7.A. K. Chandra, D. C. Kozen and L. J. Stockmeyer, Alternation, J. ACM, 28 (1981), pp. 114- 133. Google ScholarDigital Library
- 8.U. Feige, S. Goldwasser, L. Lov~sz, M. Safra, and M. Szegedy, Approximating Clique is Almost NP-Complete, Proc. 32nd Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1991, pp. 2-12. Google ScholarDigital Library
- 9.M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, Freeman, San Francisco, {979. Google ScholarDigital Library
- 10.P. Gemmell and M. Sudan. Highly resilient coffeetots for polynomials, Inf. Proc. Letters, 4.3 (1992), pp. 169-174. Google ScholarDigital Library
- 11.D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.Google ScholarDigital Library
- 12.D. Kozen, Lower bounds for natural proof systems, Proc. 18th Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1977, pp. 254-266.Google ScholarDigital Library
- 13.C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems, J. ACM, 39 (1992), pp. 859-868. Google ScholarDigital Library
- 14.C. Papadimitriou. Games Agains# Nalure, J. Comput. System Sci., 31 (1985), pp. 288-301. Google ScholarDigital Library
- 15.C. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes, J. Comput. System Sci., 43 (1991), pp. 425-440.Google ScholarCross Ref
- 16.R. Rubinfeld and M. Sudan. Testing polynomial functions efficiently and over rational domains, Proc. 3rd Symposium on Discrete Algorithms, ACM/SIAM, 1992, pp. 23-32. A more efficient tester is to appear in journal version. Google ScholarDigital Library
- 17.T. J. Schaefer, On the Complexity of Some Two-Person Perfect-Information Games, J. Cornput. System Sci., 16 (1978), pp. 185-225.Google ScholarCross Ref
- 18.A. Shamir. IF = PSPACE, J. ACM, 39 (1992), pp. 869-877. Google ScholarDigital Library
Index Terms
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
Recommendations
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
In 1990, PSPACE was shown to be identical to IP, the class of languages with interactive proofs [18,20]. Recently, PSPACE was again recharacterized, this time in terms of (Random) Probabilistically Checkable Debate Systems [7,8]. In particular, it was ...
Probabilistically Checkable Proofs Over the Reals
Probabilistically checkable proofs (PCPs) have turned out to be of great importance in complexity theory. On the one hand side they provide a new characterization of the complexity class NP, on the other hand they show a deep connection to approximation ...
Comments