Random debaters and the hardness of approximating stochastic functions

SIAM Journal on Computing

Volumn 26, Issue 2, 1997, Pages 369-400

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

^a University of Wisconsin Madison   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Approximation algorithms; Complexity theory; Probabilistic games; Proof systems; PSPACE

Indexed keywords

EID: 0000575605     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793260738     Document Type: Article

References (28)

1. M. AJTAI AND M. BEN-OR, A theorem on probabilistic constant depth circuits, in Proc. 16th Annual ACM Symposium on Theory of Computing, ACM, New York, 1984, pp. 471-474.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SEEGEDY, Proof verification and hardness of approximation problems, in Proc. 33rd Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 14-23.
3. S. ARORA AND M. SAFRA, Probabilistic checking of proofs, in Proc. 33rd Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 2-13; final version, J. Assoc. Comput. Mach., to appear.
4. S. ARORA AND M. SAFRA, Probabilistic checking of proofs, in Proc. 33rd Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 2-13; final version, J. Assoc. Comput. Mach., to appear.
5. 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.
6. M. BELLARE, S, GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistic checkable proofs and applications to approximation, in Proc. 25th Symposium on Theory of Computing, ACM, New York, 1993, pp. 286-293.
7. M. BELLARE AND M. SUDAN, Improved non-approximability results, in Proc. 26th Symposium on Theory of Computing, ACM, New York, 1994, pp. 184-193.
8. H. L. BODLAENDER, On the complexity of some coloring games, Internat. J. Found. Comput. Sci., 2 (1991), pp. 133-147.
9. R. B. BOPPANA AND M. SIPSER, The complexity of finite functions, in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, J. van Leeuwen, ed., MIT Press/Elsevier, Cambridge, MA, New York, 1990, pp. 757-800.
10. A. K. CHANDRA, D. C. KOZEN, AND L. J. STOCKMEYER, Alternation, J. Assoc. Comput. Mach., 28 (1981), pp. 114-133.
11. A. CONDON, J. FEIGENBAUM, C. LUND, AND P. SHOR, Probabilistically checkable debate systems and nonapproximability of PSPACE-hard functions, Chicago J. Theoret. Comput. Sci., 1995, No. 4; extended abstract, Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions, in Proc. 25th Symposium on Theory of Computing, ACM, New York, 1993, pp. 305-314.
12. A. CONDON, J. FEIGENBAUM, C. LUND, AND P. SHOR, Probabilistically checkable debate systems and nonapproximability of PSPACE-hard functions, Chicago J. Theoret. Comput. Sci., 1995, No. 4; extended abstract, Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions, in Proc. 25th Symposium on Theory of Computing, ACM, New York, 1993, pp. 305-314.
13. A. CONDON, J. FEIGENBAUM, C. LUND, AND P. SHOR, Random debaters and the hardness of approximating stochastic functions (extended abstract), Technical Memorandum, AT&T Bell Laboratories, Murray Hill, NJ, 1993.
14. S. EVEN AND R. TARJAN, A combinatorial problem which is complete in polynomial space, J. Assoc. Comput. Mach., 23 (1976), pp. 710-719.
15. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, M. SAFRA, AND M. SZEGEDY, Interactive proofs and the hardness of approximating cliques, J. Assoc. Comput. Mach., 43 (1996), pp. 268-292.
16. H. HUNT III, M. MARATHE, AND R. STEARNS, Generalized CNF satisfiability problems and non-efficient approximability, in Proc. 9th Conference on Structure in Complexity Theory, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 356-366.
17. D. S. JOHNSON, A catalog of complexity classes, in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, J. van Leeuwen, ed., MIT Press/Elsevier, Cambridge, MA, New York, 1990, pp. 67-162.
18. C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, J. Assoc. Comput. Mach., 39 (1992), pp. 859-868.
19. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. Assoc. Comput. Mach., 41 (1994), pp. 960-981.
20. M. MARATHE, H. HUNT III, AND S. RAVI, The complexity of approximating PSPACE-complete problems for hierarchical specifications, Nordic J. Comput., 1 (1994), pp. 275-316.
21. M. MARATHE, H. HUNT III, R. STEARNS, AND V. RADHAKRISHNAN, Hierarchical specifications and polynomial-time approximation schemes for PSPACE-complete problems, in Proc. 26th Symposium on Theory of Computing, ACM, New York, 1994, pp. 468-477; final version, Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems, SIAM J. Comput., to appear.
22. M. MARATHE, H. HUNT III, R. STEARNS, AND V. RADHAKRISHNAN, Hierarchical specifications and polynomial-time approximation schemes for PSPACE-complete problems, in Proc. 26th Symposium on Theory of Computing, ACM, New York, 1994, pp. 468-477; final version, Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems, SIAM J. Comput., to appear.
23. J. ORLIN, The complexity of dynamic languages and dynamic optimization problems, Proc. 13th Symposium on Theory of Computing, ACM, New York, 1981, pp. 218-227.
24. C. PAPADIMITRIOU, Games against nature, J. Comput. System Sci., 31 (1985), pp. 288-301.
25. T. J. SCHAEFER, On the complexity of some two-person perfect-information games, J. Comput. System Sci., 16 (1978), pp. 185-225.
26. A. SHAMIR, IP = PSPACE, J. Assoc. Comput. Mach., 39 (1992), pp. 869-877.
27. M. SUDAN, Efficient checking of polynomials and proofs and the hardness of approximation problems, Ph.D. thesis, Computer Science Division, University of California at Berkeley, Berkeley, CA, 1992.
28. L. VALIANT, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979), pp. 410-421.