Probabilistically checkable debate systems and approximation algorithms for pspace-hard functions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 305-314

  Condon, Anne ^a   Feigenbaum, Joan ^b   Lund, Carsten ^b   Shor, Peter ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; COMPUTER PROGRAMMING LANGUAGES; FUNCTION EVALUATION; PROBABILISTIC LOGICS; PROBABILITY; RANDOM PROCESSES; RECURSIVE FUNCTIONS; THEOREM PROVING;

HARD FUNCTION; NATURAL GENERALIZATION; PROBABILISTIC POLYNOMIAL TIME; PROBABILISTICALLY CHECKABLE PROOF;

APPROXIMATION ALGORITHMS; ALGORITHMS;

PROBABILISTICALLY CHECKABLE DEBATE SYSTEMS (PCDSS); PROBABILISTICALLY CHECKABLE PROOF SYSTEMS (PCPSS); PSPACE HARD FUNCTIONS;

EID: 0027206131     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167190     Document Type: Conference Paper

References (18)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Hardness of Approximation Problems, Proc. 33rd Symposium on Foundations of Computer Science, IEEE Com-puter Society Press, Los Alamitos, 1992, pp. 1423.
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.
3. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking Computations in Polylogarithrnic Time, Proc. 23rd Symposium on Theory of Computing, ACM, New York, 1991, pp. 21-31.
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.
5. E. Berlekamp and L. Welch, Error Correction of Algebraic Block Codes, US Patent Number 4, 633, 470. Appears in [10].
6. A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Probabilistically Checkable Debate Systems and Approximation Algorithms for PSPACE- Hard Functions, AT&T Bell Laboratories Technical Memorandum, January 12, 1993.
7. A. K. Chandra, D. C. Kozen and L. J. Stock-meyer, Alternation, J. ACM, 28 (1981), pp. 114133.
8. U. Feige, S. Goldwasser, L. Lovasz, 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.
9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, Freeman, San Francisco, 1979.
10. P. Gemmelland M. Sudan. Highly resilient correctors for polynomials, Inf. Proc. Letters, 43 (1992), pp.169-174.
11. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
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.
13. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems, J. ACM, 39 (1992), pp. 859-868.
14. C. Papadimitriou. Games Against Nature, J. Comput. System Sci., 31 (1985), pp. 288-301.
15. C. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
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.
17. T. J. Schaefer, On the Complexity of Some Two-Person Perfect-Information Games, J. Com-put. System Sci., 16 (1978), pp. 185-225.
18. A. Shamir. IP = PSPACE, J. ACM, 39 (1992), pp. 869-877.