Efficient probabilistically checkable proofs and applications to approximation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 294-304

  Bellare, M ^a   Goldwasser, S ^b   Lund, C ^c   Russell, A ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATION THEORY; HARDNESS; OPTIMIZATION; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBABILISTIC LOGICS; PROBABILITY; SET THEORY;

APPROXIMATION HARDNESS; CHROMATIC NUMBER; CONSTANT FACTORS; DOMINATING SETS; HARDNESS RESULT; MINIMUM SET COVER; OPTIMIZATION PROBLEMS; PROBABILISTICALLY CHECKABLE PROOF;

APPROXIMATION THEORY; THEOREM PROVING;

EFFICIENT PROBABILISTICALLY CHECKABLE PROOFS;

EID: 0027308413     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167174     Document Type: Conference Paper

References (28)

1. [AS] S. Arora and S. Safra. Approximating clique is NP-complete. FOCS 92.
2. [ALMSS] S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and in-Tractability of approximation problems. FOCS 92.
3. [ADP] G. Ausiello, A. D'Atri and M. Protasi. Structure preserving reductions among convex optimization problems. Journal of Computer and System Sciences 21, 136-153 (1980).
4. [BFL] L. Babai, L. Fortnow and C. Lund. Non- Deterministic Exponential Time has Two-Prover Interactive Protocols. FOCS 90.
5. [BFLS] L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking Computations in Polyloga- rithmic Time. STOC 91.
6. [Be] M. Bellare. Interactive Proofs and Approximation. IBM Research Report RC 17969 (May 1992).
7. [BGG] M. Bellare, O. Goldreioh and S. Gold-wasser. Randomness in Interactive Proofs. FOCS 90.
8. [BR] M. Bellare and P. Rogaway. The Complexity of Approximating a Nonlinear program. IBM Research Report RC 17831 (March 1992).
9. [BGKW] M. Ben-Or, S. Goldwasser, J. Kilian and A. wlgderson. Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. STOC 88.
10. [BLR] M. Blum, M. Luby, and R. Rubinfeld. Self-Testing and self-correcting programs, with applications to numerical programs. STOC 90.
11. [CW] A. COHEN AND A. WlGDERSON. Dispersers, Deterministic Amplification, and Weak Random Sources. FOCS 89.
12. [Co] A. Condon. The complexity of the max word problem, or the power of one-way interactive proof systems. STACS 91.
13. [FRS] L. Fortnow, J. Rompel and M. Sipser. On the power of multiprover interactive protocols. Proceedings of the 3rd Structures, IEEE (1988).
14. [FGLSS] U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. FOCS 91.
15. [FL] U. Feige and L. Lovasz. Two-Prover One Round Proof Systems: Their Power and their Problems. STOC 92.
16. [GS] P. Gemmell and M. Sudan. Highly Resilient Correctors For Polynomials. IPL, 1992.
17. [IZ] R. Impagliazzo and D. Zuckerman. How to Recycle Random Bits. FOCS 89.
18. [Jo] D. Johnson. Approximation algorithms for combinatorial problems. J. of Computer and System Sciences 9, 256-278 (1974).
19. [KT] P. Kolaitis and M. Thakur. Approximation properties of NP minimization classes. Structure in Complexity Theory, 1991.
20. [LS] D. Lapidot and A. Shamir. Fully Parallelized Multi-Prover Protocols for NEXP-Time. FOCS 91.
21. [Lo] L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics 13, 383390 (1975).
22. [LY1] C. Lund and M. Yannakakis. On the Hardness of Approximating Minimization Problems. STOC 93.
23. [LY2] C. Lund and M. Yannakakis. The Approximation of Maximum Subgraph Problems. ICALP 93.
24. [MS] F. Mac Williams and N. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1981.
25. [PY] C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. STOC 88.
26. [PS] S. Phillips and S. Safra. PCP and tighter bounds for approximating MAXSNP. Manuscript, 1992.
27. [Va] S. VAVASIS. On approximation algorithms for concave programming. Recent Advances in Global Optimization, C. A. Floudas and P.M. Pardalos, pp. 3-18, Princeton University Press, 1992.
28. [Zu] D. Zuckerman. NP-Complete Problems have a version that is hard to Approximate. Structure in Complexity Theory, 1993.