Probabilistic checking of proofs: A new characterization of NP

Journal of the ACM

Volumn 45, Issue 1, 1998, Pages 70-122

  Arora, Sanjeev ^a,c   Safra, Shmuel ^b,d  

^a PRINCETON UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c Tel Aviv University ^*  (United States)

^d STANFORD UNIVERSITY   (United States)

Author keywords

F.1.2 Computation by Abstract Devices : Modes of Computation; F.1.3 Computation by Abstract Devices : Complexity Classes; F.2.1 Analysis of Algorithms and Problem Complexity : Numerical Algorithms and Problems

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERROR CORRECTION; FORMAL LOGIC; POLYNOMIALS; PROBABILITY; SET THEORY; THEOREM PROVING;

LOGARITHMIC RANDOM BIT NUMBERS;

COMPUTATIONAL COMPLEXITY;

EID: 0031651077     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/273865.273901     Document Type: Article

References (55)

1. AJTAI, M., KOMLÓS, J., AND SZEMEREDI, E. 1987. Deterministic simulation in LOGSPACE. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (New York, N.Y., May 25-27). ACM, New York, pp. 132-140.
2. ALON, N., GOLDREICH, O., HASTAD, J., AND PERALTA, R. 1992. Simple constructions of almost k-wise independent random variables. Rand. Struct. Algor. 3, 3, 289-304.
3. ARORA, S., BABAI, L., STERN, J., AND SWEEDYK, Z. 1993. The hardness of approximate optima in lattices, codes and linear equations. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 724-733.
4. ARORA, S., AND LUND, C. 1996. Hardness of approximations. Chapter 10 in Approximation Algorithms for NP-hard Problems, Dorit Hochbaum, ed. PWS Publishing.
5. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. 1992a. Proof verification and intractability of approximation problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 13-22.
6. ARORA, S., MOTWANI, R., SAFRA, M., SUDAN, M., AND SZEGEDY, M. 1992b. PCP and approximation problems. Manuscript.
7. ARORA, S., AND SAFRA, S. 1992. Probabilistic checking of proofs: A new characterization of NP. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 2-12.
8. ARORA, S., AND SUDAN, M. 1997. Improved low degree testing and its applications. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 496-505.
9. BABAI, L. 1985. Trading group theory for randomness. In Proceedings of the 17th ACM Symposium on Theory of Computing (Providence, R.I., May 6-8). ACM, New York, pp. 421-429.
10. BABAI, L., FORTNOW, L., LEVIN, L., AND SZEGEDY, M. 1991a. Checking computations in polylogarithmic time. In Proceedings of the 23rd ACM Symposium on Theory of Computing (New Orleans, La., May 6-8). ACM, New York, pp. 21-31.
11. BABAI, L., FORTNOW, L., AND LUND, C. 1991b. Non-deterministic exponential time has two-prover interactive protocols. Comput. Comp. 1, 3-40.
12. BELLARE, M. 1993. Interactive proofs and approximation: Reductions from two provers in one round. In Proceedings of the 2nd Israel Symposium on Theory and Computing Systems. IEEE Computer Press, New York, pp. 266-274.
13. BELLARE, M., GOLDREICH, O., AND SUDAN, M. 1995. Free bits and nonapproximability: Towards tight results. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 422-431.
14. BELLARE, M., GOLDWASSER, S., LUND, C., AND RUSSELL, A. 1993. Efficient probabilistically checkable proofs with applications to approximation. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 113-131. (Errata in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, p. 820.)
15. BELLARE, M., AND ROGAWAY, P. 1993. The complexity of approximating nonlinear programs. In Complexity of Numerical Optimization, P. M. Pardalos, ed. World Scientific.
16. BELLARE, M., AND SUDAN, M. 1994. Improved non-approximability results. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 184-193.
17. BEN-OR, M., GOLDWASSER, S., KILIAN, J., AND WIGDERSON, A. 1988. Multi prover interactive proofs: How to remove intractability assumptions. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Chicago, Ill., May 2-4). ACM, New York, pp. 113-121.
18. BERLEKAMP, E., AND WELCH, L. 1986. Error correction of algebraic block codes. US Patent Number 4,633,470.
19. BLUM, M., AND KANNAN, S. 1989. Designing programs that check their work. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, Wash., May 15-17). ACM, New York, pp. 86-97.
20. BLUM, M., LUBY, M., AND RUBINFELD, R. 1990. Self-testing/correcting with applications to numerical problems. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (Baltimore, Md., May 12-14). ACM, New York, pp. 73-83.
21. BOPPANA, R., AND HALLDÓRSSON, M. 1992. Approximating maximum independent sets by excluding subgraphs. BIT 32, 180-196.
22. CHANG, R., CHOR, B., GOLDREICH, O., HARTMANIS, J., HASTAD, J., RANJAN, D., AND ROHATGI, P. 1994. The random oracle hypothesis is false. J. Comput. Syst. Sci. 49, 1.
23. CHOR, B., AND GOLDREICH, O. 1989, On the power of two-point based sampling. J. Complex. 5, 96-106.
24. CONDON, A. 1993. The complexity of the max-word problem and the power of one-way interactive proof systems. Computat. Complex. 3, 292-305.
25. CONDON, A., FEIGENBAUM, J., LUND, C., AND SHOR, P. 1993. Random debaters and the hardness of approximating stochastic functions. In Proceedings of the 9th Structure in Complexity Theory Conference. pp. 280-293.
26. CONDON, A., AND LADNER, R. 1989. On the complexity of space bounded interactive proofs. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 462-467.
27. COOK, S. A. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (Shaker Heights, Oh., May 3-5). ACM, New York, pp. 151-158.
28. FAGIN, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computer Computations, Richard Karp, ed. AMS, Providence, R.I., pp. 43-73.
29. FEIGE, U., GOLDWASSER, S., LOVÁSZ, L., SAFRA, S., AND SZEGEDY, M. 1991. Approximating clique is almost NP-complete. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 2-12.
30. FEIGE, U., AND LOVÁSZ, L. 1992. Two-prover one-round proof systems: Their power and their problems. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 733-741.
31. FORTNOW, L., ROMPEL, J., AND SIPSER, M. 1988. On the power of multi-prover interactive protocols. In Proceedings of the 3rd Conference on Structure in Complexity Theory. pp. 156-161.
32. FORTNOW, L., AND SIPSER, M. 1988. Are there interactive protocols for co-np languages? Inf. Proc. Lett. 28, 249-251.
33. GOLDWASSER, S., MICALI, S., AND RACKOFF, C. 1989. The knowledge complexity of interactive proofs. SIAM J. Comput. 18, 186-208.
34. 1-∈. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 627-636.
35. HASTAD, J. 1997. Some optimal inapproximability results. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 1-10.
36. KARP, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, Miller and Thatcher, eds. Plenum Press, New York, pp. 85-103.
37. KHANNA, S., LINIAL, N., AND SAFRA, S. 1993. On the hardness of approximating the chromatic number. In Proceedings of the 2nd Israel Symposium on Theory and Computing Systems, ISTCS. IEEE Computer Society Press, New York, pp. 250-260.
38. KIWI, M., LUND, C., RUSSELL, A., SPIELMAN, D., AND SUNDARAM, R. 1994. Alternation in interaction. In Proceedings of the 9th Structure in Complexity Theory Conference. IEEE Computer Press, New York, pp. 294-303.
39. LAPIDOT, D., AND SHAMIR, A. 1991. Fully parallelized multi prover protocols for NEXPTIME. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 13-18.
40. LEVIN, L. 1973. Universal'nyǐe perebornyǐe zadachi (universal search problems: in Russian). Prob. Per. Inf. 9, 3, 265-266.
41. LIPTON, R. 1989. Efficient checking of computations. In Proceedings of 6th STACS.
42. LUND, C., FORTNOW, L., KARLOFF, H., AND NISAN, N. 1992. Algebraic methods for interactive proof systems. J. ACM, 39, 4 (Oct.), 859-868.
43. LUND, C., AND YANNAKAKIS, M. 1994. On the hardness of approximating minimization problems. J. ACM, 41, 5 (Sept.), 960-981.
44. NAOR, J., AND NAOR, M. 1993. Small-bias probability spaces: efficient constructions and applications. Siam J. Comput., 22, 838-856.
45. PAPADIMITRIOU, C. 1994. Computational Complexity. Addison Wesley, Reading, Mass.
46. PAPADIMITRIOU, C., AND YANNAKAKIS, M. 1991. Optimization, approximation and complexity classes. J. Comput. Syst. Sci. 43, 425-440.
47. PHILLIPS, S., AND SAFRA, S. 1992. PCP and tighter bounds for approximating MAX-SNP. Manuscript.
48. POLISHCHUK, A., AND SPIELMAN, D. 1994. Nearly-linear size holographic proofs. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25), ACM, New York, pp. 194-203.
49. RAZ, R., AND SAFRA, S. 1997. A sub-constant error-probability low-degree test and a sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 475-484.
50. RUBINFELD, R., AND SUDAN, M. 1992. Self-testing polynomial functions efficiently and over rational domains. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (Orlando, Fla., Jan. 27-29). ACM, New York, pp. 23-32.
51. SHAMIR, A. 1992. IP = PSPACE. J. ACM, 39, 4 (Oct.), 869-877.
52. SHEN, A. 1991. Multilinearity test made easy. Manuscript.
53. SUDAN, M. 1992. Efficient checking of polynomials and proofs and the hardness of approximation problems. Ph.D. dissertation. U.C. Berkeley, Berkeley, Calif.
54. ZUCKERMAN, D. 1991. Simulating BPP using a general weak random source. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 79-89.
55. ZUCKERMAN, D. 1993. NP-complete problems have a version that's hard to approximate. In Proceedings of the 8th Structure in Complexity Theory Conference, pp. 305-312.