Proof verification and hardness of approximation problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 14-23

  Arora, Sanjeev ^a   Lund, Carsten ^b   Motwani, Rajeev ^c   Sudan, Madhu ^a   Szegedy, Mario ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

HARD PROBLEMS; HARDNESS OF APPROXIMATION; HIGH PROBABILITY; MAXIMAL CLIQUE; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME; PROOF VERIFICATION; RANDOM CHOICE;

POLYNOMIAL APPROXIMATION;

EID: 85028925878     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267823     Document Type: Conference Paper

References (40)

1. S. Arora, R. Motwani, S. Safra and M. Sudan. PCP and Approximation Problems. Unpublished note, 1992.
2. S. Arora and S. Safra. Probabilistic Checking of Proofs: A New Characterization of NP. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992.
3. Y. Azar. Personal Communication. 1992.
4. L. Babai. Trading group theory for randomness. In Proc. 17th ACM Symp. on Theory of Computing, pages 421-420, 1985.
5. L. Babai, L. Fortnow, and C. Lund. Non-deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity, vol. 1, pages 3-40, 1991.
6. L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking Computations in Polylogarithmic Time. In Proc. 23rd ACM Symp. of Theory of Computing, pages 21-31, 1991.
7. M. Ben-Or, S. Goldwasser, J. Kilian and A. Wigderson. Multi-prover interactive proofs: How to remove intractability. In Proc. 20th ACM Symp. on Theory of Computing, pages 113-131, 1988.
8. A. Blum, T. Jiang, M. Li, J. Tromp and M. Yannakakis. Linear Approximation of Shortest Su-perstrings. In Proc. 23rd ACM Symp. on Theory of Computing pages 328-336, 1991.
9. M. Blum, M. Luby, R. Rubinfeld. Self-Testing/Correcting with Applications to Numerical Problems. In Proc. 22th A CM Symp. on Theory of Computing, pages 73-83, 1990.
10. M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. Information Processing Letters, vol. 32, pages 171-176, 1989.
11. P. Berman and G. Schnitger. On the Complexity of Approximating the Independent Set Problem. Information and Computation, vol. 96, pages 77-94, 1992.
12. S. A. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symp. on Theory of Computing, pages 151-158, 1971.
13. E. Dahlhaus, D. S. Johnson, C. H. Papa-ditriou, P. D. Seymour and M. Yannakakis. The complexity of multiway cuts. In Proc. 24th ACM Symp. on Theory of Computing, pages 241-451, 1992.
14. R. Fagin. Generalized First-Order Spectra and Polynomial-time Recognizable Sets. In Richard Karp (ed.), Complexity of Computer Computations, AMS, 1974.
15. R. Freivalds. Fast Probabilistic Algorithms. In Mathematical Foundations of Computer Science. Springer-Verlag Lecture Notes in Computer Science, No. 74, pages 57-69, 1979.
16. U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. 82nd IEEE Symp. on Foundations of Computer Science, pages 2-12, 1991.
17. U. Feige and L. Lovasz. Two-Prover One-Round Proof Systems: Their Power and Their Problems. In Proc. of 24th ACM Symp. on Theory of Computing, pages 733-744, 1992.
18. L. Fortnow, J. Rompel and M. Sipser. On the power of multi-prover interactive protocols. In Proc. 3rd IEEE Symp. on Structure in Complexity Theory, pages 156-161, 1988.
19. Michael R. Garey and David S. Johnson. The complexity of near-optimal graph coloring. J. of the ACM, vol 23, pages 43-49, 1976.
20. Michael R. Garey and David S. Johnson. "Strong" NP-completeness results: motivation, examples and Implications. J. of the ACM, vol 25, pages 499-508, 1978.
21. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
22. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-Testing/Correcting for Polynomials and for Approximate Functions. In Proc. 23th ACM Symp. on Theory of Computing, pages 32-42, 1991.
23. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, vol. 18, pages 186-208, 1989.
24. V. Kann. Maximum bounded 3-dimensional matching is MAXSNP-complete. Information Processing Letters, vol. 37, pages 27-35, 1991.
25. R.M. Karp. Reducibility among combinatorial problems. In Raymond E. Miller and James W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
26. D. Karger, R. Motwani and G. D. S. Ramku-mar. On Approximating the Longest Path in a Graph. Manuscript, 1992.
27. L. Levin. Universal'nyfe perebornyfe zadachi (Universal search problems, in Russian), In Problemy Peredachi Informatsii, vol. 9, pages 265-266, 1973. A corrected English translation appears in an appendix to Trakhtenbrot
28. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. In Proc. 22nd ACM Symp. on Theory of Computing, pages 2-10, 1990.
29. D. Lapidot and A. Shamir. Fully Parallelized Multi Prover Protocols for NEXP-time. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 13-18, 1991.
30. C. Lund and M. Yannakakis. On the Hardness of Approximating Minimization Problems. Manuscript, 1992.
31. F. Mac Williams and N. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1981.
32. R. Motwani. Lecture Notes on Approximation Algorithms. Technical Report, Dept. of Computer Science, Stanford University (1992).
33. C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences, vol. 43, pages 425-440, 1991.
34. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two, Mathematics of Operations Research, to appear.
35. R. Rubinfeld. A Mathematical Theory of Self-Checking, Self-Testing and Self-Correcting Programs. Ph.D. Thesis, Computer Science Department, U.C. Berkeley, 1990.
36. R. Rubinfeld, and M. Sudan. Testing Polynomial Functions Efficiently and over Rational Domains. In Proc. 3rd Annual ACM-SIAM Symp. on Discrete Algorithms, pages 23-32, 1992.
37. A. Shamir. IP=PSPACE. In Proc. 22nd ACM Symp. on Theory of Computing, pages 11-15, 1990.
38. S. Sahni and T. Gonzalez. P-complete approximation problems. J ACM, vol. 23, pages 555-565, 1976.
39. B. A. Trakhtenbrot. A survey of Russian approaches to Perebor (brute-force search) algorithms. In Annals of the History of Computing vol. 6, pages 384-400, 1984.
40. M. Yannakakis. On the Approximation of Maximum Satisfiability. In Proc. 3rd Annual ACM-SIAM Symp. on Discrete Algorithms, pages 1-9, 1992.