Free Bits, PCPs, and Nonapproximability-Towards Tight Results

SIAM Journal on Computing

Volumn 27, Issue 3, 1998, Pages 804-915

  Bellare, Mihir ^a   Goldreich, Oded ^b,c   Sudan, Madhu ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c US Israel Binational Science Foundation   (Israel)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0542423500     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796302531     Document Type: Article

References (89)

1. L. ADLEMAN, Two theorems on random polynomial time, in Proceedings of the 19th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1978, pp. 75-83.
2. M. AJTAI, J. KOMLOS, AND E. SZEMEREDI, Deterministic simulation in logspace, in Proceedings of the 19th Annual Symposium on the Theory of Computing, ACM, New York, 1987, pp. 132-140.
3. N. ALON, U. FEIGE, A. WIGDERSON, D. ZUCKERMAN, Derandomized graph products, Computat. Complexity, 5 (1995), pp. 60-75.
4. N. ALON, J. SPENCER, AND P. ERDOS, The Probabilistic Method, John Wiley and Sons, New York, 1992.
5. E. AMALDI AND V. KANN, The complexity and approximability of finding maximum feasible subsystems of linear relations, Theoret. Comput. Sci., 147 (1995), pp. 181-210.
6. S. ARORA, Reductions, codes, PCPs, and inapproximability, in Proceedings of the 36th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 404-413.
7. S. ARORA, L. BASAI, J. STERN, AND Z. SWEEDYK, The hardness of approximate optima in lattices, codes and systems of linear equations, J. Comput. System Sci., 54 (1997), pp. 317-331.
8. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and intractability of approximation problems, in Proceedings of the 33rd Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 14-23.
9. S. ARORA AND S. SAFRA, Probabilistic checking of proofs: A new characterization of NP, in Proceedings of the 33rd Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 2-13.
10. L. BASAI, Trading group theory for randomness, in Proceedings of the 17th Annual Symposium on the Theory of Computing, ACM, New York, 1985, pp. 421-429.
11. L. BASAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Computat. Complexity, 1 (1991), pp. 3-40. (See also addendum in 2 (1992), p. 374.)
12. L. BASAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Computat. Complexity, 1 (1991), pp. 3-40. (See also addendum in 2 (1992), p. 374.)
13. L. BASAI, L. FORTNOW, L. LEVIN, AND M. SZEGEDY, Checking computations in polylogarithmic time, in Proceedings of the 23rd Annual Symposium on the Theory of Computing, ACM, New York, 1991, pp. 21-31.
14. R. BAR-YEHUDA AND S. EVEN, A linear time approximation algorithm for the weighted vertex cover problem, J. Algorithms, 2 (1981), pp. 198-201.
15. R. BAR-YEHUDA AND S. EVEN, A local ratio theorem for approximating the weighted vertex cover problem, in Analysis and Design of Algorithms for Combinatorial Problems, NorthHolland Math. Stud. 109, North-Holland, Amsterdam, 1985, pp. 27-45.
16. R. BAR-YEHUDA AND S. MORAN, On approximation problems related to the independent set and vertex cover problems, Discrete Appl. Math., 9 (1984), pp. 1-10.
17. M. BELLARE, Interactive proofs and approximation: Reductions from two provers in one round, in Proceedings of the Second Israel Symposium on Theory and Computing Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 266-274.
18. M. BELLARE, D. COPPERSMITH, J. HASTAD, M. KIWI, AND M. SUDAN, Linearity testing in characteristic two, IEEE Trans. Inform. Theory, 42 (1996), pp. 1781-1795.
19. M. BELLARE, O. GOLDREICH, AND S. GOLDWASSER, Randomness in interactive proofs, Computat. Complexity, 3 (1993), pp. 319-354.
20. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and non-approximabilitytowards tight results, extended abstract of this paper in Proceedings of the 36th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 422-431.
21. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and non-approximabilitytowards tight results, preliminary versions of this paper, Report TR95-024, Elec. Colloq. Comput Complexity, May 1995 (revised Sept. 1995, Jan. 1996, Dec. 1996, and Aug. 1997), http://www.eccc.uni-trier.de/eccc/
22. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proceedings of the 25th Annual Symposium on the Theory of Computing, ACM, New York, 1993, pp. 294-304. (See also Errata sheet in Proceedings of the 26th Annual Symposium on the Theory of Computing, ACM, New York, 1994, pp. 820-820).
23. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proceedings of the 25th Annual Symposium on the Theory of Computing, ACM, New York, 1993, pp. 294-304. (See also Errata sheet in Proceedings of the 26th Annual Symposium on the Theory of Computing, ACM, New York, 1994, pp. 820-820).
24. M. BELLARE AND P. ROGAWAY, The complexity of approximating a nonlinear program, J. Math. Programming Ser. A, 69 (1995), pp. 429-441. Also in Complexity of Numerical Optimization, P. M. Pardalos, ed., World Scientific, River Edge, NJ, 1993, pp. 16-32.
25. M. BELLARE AND P. ROGAWAY, The complexity of approximating a nonlinear program, J. Math. Programming Ser. A, 69 (1995), pp. 429-441. Also in Complexity of Numerical Optimization, P. M. Pardalos, ed., World Scientific, River Edge, NJ, 1993, pp. 16-32.
26. M. BELLARE AND M. SUDAN, Improved non-approximability results, in Proceedings of the 26th Annual Symposium on the Theory of Computing, ACM, New York, 1994, pp. 184-193.
27. M. BEN-OR, S. GOLDWASSER, J. KILIAN, AND A. WIGDERSON, Multi-prover interactive proofs: How to remove intractability assumptions, in Proceedings of the 20th Annual Symposium on the Theory of Computing, ACM, New York, 1988, pp. 113-131.
28. P. BERMAN AND G. SCHNITGER, On the complexity of approximating the independent set problem, Inform, and Comput., 96 (1992), pp. 77-94.
29. A. BLUM, Algorithms for Approximate Graph Coloring, Ph.D. thesis, Department of Computer Science, MIT, Cambridge, MA, 1991.
30. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
31. R. BOPPANA AND M. HALLDÓRSSON, Approximating maximum independent sets by excluding subgraphs, BIT, 32 (1992), pp. 180-196.
32. J. BRUCK AND M. NAOR, The hardness of decoding with preprocessing, IEEE Trans. Inform. Theory, 36 (1990), pp. 381-385.
33. A. COHEN AND A. WIGDERSON, Dispersers, deterministic amplification, and weak random sources, in Proceedings of the 30th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 14-19.
34. A. CONDON, The complexity of the max word problem and the power of one-way interactive proof systems, Comput. Complexity, 3 (1993), pp. 292-305.
35. S. COOK, The complexity of theorem-proving procedures, in Proceedings of the 3rd Annual Symposium on the Theory of Computing, ACM, New York, 1971, pp. 151-158.
36. P. CRESCENZI AND V. KANN, A Compendium of NP Optimization Problems, Technical Report, Dipartimento di Scienze dell' Informazione, Università di Roma "La Sapienza," SI/RR95/02, 1995. The list is updated continuously. The latest version is available via http: //www.nada.kth.se/~viggo/problemlist/compendium.html
37. P. CRESCENZI, R. SILVESTRI, AND L. TREVISAN, To weight or not to weight; Where is the question?, in Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 68-77.
38. S. EVEN, A. ITAI, AND A. SHAMIR, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput., 5 (1976), pp. 691-703.
39. S. EVEN, A. SELMAN, AND Y. YACOBI, The complexity of promise problems with applications to public-key cryptography, Inform. Control, 2 (1984), pp. 159-173.
40. U. FEIGE, Randomized graph products, chromatic numbers, and the Lovásztheta function, in Proceedings of the 27th Annual Symposium on the Theory of Computing, ACM, New York, 1995, pp. 635-640.
41. U. FEIGE, Set cover. A threshold of In n for approximating set cover, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 314-318.
42. U. FEIGE AND M. GOEMANS, Approximating the value of two prover proof systems, with application to Max-2SAT and Max-DICUT, in Proceedings of the Third Israel Symposium on Theory and Computing Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 182-189.
43. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Interactive proofs and the hardness of approximating cliques, J. ACM, 43 (1996), pp. 268-292.
44. U. FEIGE AND J. KILIAN, Two prover protocols - low error at affordable rates, in Proceedings of the 26th Annual Symposium on the Theory of Computing, ACM, New York, 1994, pp. 172-183.
45. U. FEIGE AND J. KILIAN, Zero-knowledge and the chromatic number, in Proceedings of the llth Annual Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 1996.
46. U. FEIGE AND L. LOVÁSZ, Two-prover one round proof systems: Their power and their problems, in Proceedings of the 24th Annual Symposium on the Theory of Computing, ACM, New York, 1992, pp. 733-744.
47. L. FORTNOW, J. ROMPEL, AND M. SlPSER, On the power of multiprover interactive protocols, Theoret. Comput. Sci., 134 (1994), pp. 545-557.
48. M. FÜRER, Improved hardness results for approximating the chromatic number, in Proceedings of the 36th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 414-421.
49. M. FÜRER, O. GOLDREICH, Y. MANSOUR, M. SIPSER, AND S. ZACHOS, On completeness and soundness in interactive proof systems, in Advances in Computing Research: A Research Annual, Randomness and Computation, S. Micali, ed., Vol. 5, JAI Press, Greenwich, CT, pp. 429-442.
50. M. GAREY AND D. JOHNSON, The complexity of near optimal graph coloring, J. ACM, 23 (1976), pp. 43-49.
51. M. GAREY AND D. JOHNSON, Computers and Intractability: A guide to the Theory of NP-completeness, W. H. FVeeman and Company, San Francisco, CA, 1979.
52. M. GAREY, D. JOHNSON, AND L. STOCKMEYER, Some simplified NP-complete graph problems, Theoret. Comput. Sci., l (1976), pp. 237-267.
53. M. GOEMANS AND D. WILLIAMSON, New 3/4-approximation algorithms for the maximum satisfiablity problem, SIAM J. Discrete Math., 7 (1994), pp. 656-666.
54. M. GOEMANS AND D. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
55. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, Proofs that yield nothing but their validity, or all languages in NP have zero-know ledge proof systems, J. ACM, 38 (1991), pp. 691-729.
56. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proofs, SIAM J. Comput., 18 (1989), pp. 186-208.
57. S. GOLDWASSER AND M. SIPSER, Private coins versus public coins in interactive proof systems, in Proceedings of the 18th Annual Symposium on the Theory of Computing, ACM, New York, 1986, pp. 59-68.
58. J. HASTAD, Testing of the long code and hardness for clique, in Proceedings of the 28th Annual Symposium on the Theory of Computing, ACM, New York, 1996, pp. 11-19.
59. 1-epsi;, in Proceedings of the 37th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 627-636.
60. J. HASTAD, Getting optimal in-approximability results, in Proceedings of the 29th Annual Symposium on the Theory of Computing, ACM, New York, 1997, pp. 1-10.
61. D. HOCHBAUM, Efficient algorithms for the stable set, vertex cover and set packing problems, Discrete Appl. Math., 6 (1983), pp. 243-254.
62. R. IMPAGLIAZZO AND D. ZuCKERMAN, How to recycle random bits, in Proceedings of the 30th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 248-253.
63. N. JONES, Y. LIEN, AND W. LAASER, New problems complete for non-deterministic log space, Math. Systems Theory, 10 (1976), pp. 1-17.
64. N. KAHALE, Eigenvalues and expansion of regular graphs, J. ACM, 42 (1995), pp. 1091-1106.
65. V. KANN, S. KHANNA, J. LAGERGREN, AND A. PANCONESI, On the Hardness of Approximating MAX k-CUT and Its Dual, Technical Report TRITA-NA-P9505, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1995.
66. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, in Proceedings of the 35th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 2-13.
67. H. KARLOFF AND U. ZwiCK, A 7/8-eps approximation algorithm for MAX 3SAT?, in Proceedings of the 38th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 406-415.
68. R. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, Miller and Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
69. S. KHANNA, N. LINIAL, AND S. SAFRA, On the hardness of approximating the chromatic number, in Proceedings of the Second Israel Symposium on Theory and Computing Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 250-260.
70. D. LAPIDOT AND A. SHAMIR, Fully parallelized multi-prover protocols for NEXP-time, in Proceedings of the 32nd Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 13-18.
71. C. LAUTEMANN, BPP and the polynomial hierarchy, Inform. Process Lett., 17 (1983), pp. 215-217.
72. L. LEVIN, Universal'nyǐe perebornyǐe zadachi (universal search problems), Problemy Peredachi Informatsii, 9 (1973), pp. 265-266, (in Russian).
73. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Explicit expanders and the Ramanujan conjectures, in Proceedings of the 18th Annual Symposium on the Theory of Computing, ACM, New York, 1986, pp. 240-246.
74. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
75. C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, J. ACM, 39 (1992), pp. 859-868.
76. F. MAcWILLIAMS AND N. SLOANE, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1981.
77. B. MONIEN AND E. SPECKENMEYER, Ramsey numbers and an approximation algorithm for the vertex cover problem, Acta Inform., 22 (1985), pp. 115-123.
78. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
79. C. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
80. E. PETRANK, The Hardness of Approximations: Gap Location, Technical Report TR-754, Department of Computer Science, Technion - Israel Institute of Technology, 1992.
81. A. POLISHCHUK AND D. SPIELMAN, Nearly-linear size holographic proofs, in Proceedings of the 26th Annual Symposium on the Theory of Computing, ACM, New York, 1994, pp. 194-203.
82. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.
83. S. SAHNI AND T. GONZALES, P-complete approximation problems, J. ACM, 23 (1976), pp. 555-565.
84. A. SHAMIR, IP=PSPACE, J. ACM, 39 (1992), pp. 869-877.
85. G. TARDOS, Multi-prover encoding schemes and three prover proof systems, J. Comput. System Sci., 53 (1996), pp. 251-260.
86. A. TA-SHMA, A Note on PCP vs. MIP, Inform. Process. Lett., 58 (1996), pp. 135-140.
87. L. TREVISAN, G. SORKIN, M. SUDAN, AND D. WILLIAMSON, Gadgets, approximation and linear programming, in Proceedings of the 37th Symposium on Foundations in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 617-626.
88. M. YANNAKAKIS, On the approximation of maximum satisfiability, J. Algorithms, 17 (1994), pp. 475-502.
89. D. ZUCKERMAN, On unapproximable versions of N P-complete problems, SIAM J. Comput., 25 (1996), pp. 1293-1304.