Clique is hard to approximate within n1-ε

Acta Mathematica

Volumn 182, Issue 1, 1999, Pages 105-142

  Håstad, Johan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000109157     PISSN: 00015962     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02392825     Document Type: Article

References (34)

1. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M. & SZEGEDY, M., Proof verification and the hardness of approximation problems, in 33rd Annual IEEE Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992), pp. 14-23. To appear in J. ACM.
2. ARORA, S. & SAFRA, S., Probabilistic checking of proofs: a new characterization of NP. J. ACM, 45 (1998), 70-122.
3. BABAI, L., Trading group theory for randomness, in 17th Annual ACM Symposium on Theory of Computing (Providence, RI, 1985), pp. 420-429.
4. BABAI, L., FORTNOW, L., LEVIN, L. & SZEGEDY, M., Checking computations in polynomial time, in 23rd Annual ACM Symposium on Theory of Computing (New Orleans, LA, 1991), pp. 21-31.
5. BABAI, L., FORTNOW, L. & LUND, C., Nondeterministic exponential time has two-prover interactive protocols. Comput. Complexity, 1 (1991), 3-40.
6. BELLARE, M., COPPERSMITH, D., HÅSTAD, J., KIWI, M. & SUDAN, M., Linearity testing in characteristic two. IEEE Trans. Inform. Theory, 42 (1996), 1781-1796.
7. BELLARE, M., GOLDREICH, O. & SUDAN, M., Free bits, PCl's and nonapproximability-towards tight results. SIAM J. Comput., 27 (1998), 804-915.
8. BELLARE, M., GOLDWASSER, S., LUND, C. & RUSSELL, A., Efficient probabilistically checkable proofs and applications to approximation, in 25th Annual ACM Symposium on Theory of Computing (San Diego, CA, 1993), pp. 294-304.
9. BELLARE, M. & SUDAN, M., Improved nonapproximability results, in 26th Annual ACM Symposium on Theory of Computing (Montreal, 1994), pp. 184-193.
10. BEN-OR, M., GOLDWASSER, S., KILIAN, J. & WIGDERSON, A., Multiprover interactive proofs. How to remove intractability, in 20th Annual ACM Symposium on Theory of Computing (Chicago, IL, 1988), pp. 113-131.
11. BERMAN, P. & SCHNITGER, G., On the complexity of approximating the independent set problem. Inform, and Comput., 96 (1992), 77-94.
12. BOPPANA, R. & HALLDÓRSSON, M., Approximating maximum independent sets by excluding subgraphs. BIT, 32 (1992), 180-196.
13. p-product spaces, in Seminaire d'analyse fonctionnelle (1979 1980), pp. 4.1-4.9. École Polytechnique, Palaiseau, 1980.
14. COOK, S. A., The complexity of theorem proving procedure, in 3rd Annual ACM Symposium on Theory of Computing (1971), pp. 151-158.
15. FEIGE, U., A threshold of Inn for approximating set cover, in 28th Annual ACM Symposium on Theory of Computing (Philadelphia, PA, 1996), pp. 314-318. To appear in J. ACM.
16. FEIGE, U. & GOEMANS, M., Approximating the value of two-prover proof systems, with applications to MAX 2SAT and MAX DICUT, in 3rd Israel Symposium on the Theory of Computing and Systems (Tel Aviv, 1995), pp. 182-189. IEEE Comput. Soc. Press, Los Alamitos, CA, 1995.
17. FEIGE, U., GOLDWASSER, S., LOVÁsz, L., SAFRA, S. & SZEGEDY, M., Interactive proofs and the hardness of approximating cliques. J. ACM, 43 (1996), 268-292.
18. FEIGE, U. & KILIAN, J., Two prover protocols -Low error at affordable rates, in 26th Annual ACM Symposium on Theory of Computing (Montreal, 1994), pp. 172-183.
19. -Zero-knowledge and the chromatic number, in 11th Annual IEEE Conference on Computational Complexity (Philadelphia, PA, 1996), pp. 278-287.
20. FORTNOW, L., ROMPEL, J. & SIPSER, M., On the power of multi-prover interactive protocols, in 3rd IEEE Symposium on Structure in Complexity Theory (1988), pp. 156-161.
21. GAREY, M. R. & JOHNSON, D. S., Computers and Intractability. A Guide to the Theory of NP-completeness. W. H. Freeman, San Fransisco, CA, 1979.
22. GOEMANS, M. & WILLIAMSON, D., .878-approximation algorithms for Max-Cut and Max-2-SAT, in 26th Annual ACM Symposium on Theory of Computing (Montreal, 1994), pp. 422-431.
23. GOLDWASSER, S., MICALI, S. & RACKOFF, C., The knowledge complexity of interactive proof systems. SIAM J. Comput., 18 (1989), 186-208.
24. HÅSTAD J., Testing of the long code and hardness for clique, in 28th Annual ACM Symposium on Theory of Computing (Philadelphia, PA, 1996), pp. 11-19. ACM, New York, 1996.
25. 1-ε, in 37th Annual IEEE Symposium on Foundations of Computer Science (Burlington, VT, 1996), pp. 627-636. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.
26. _ Some optimal in-approximability results, in 29th Annual ACM Symposium on Theory of Computing (1997), pp. 1-10.
27. JOHNSON, D. S., Approximation algorithms for combinatorial problems. J. Comput. System Sci., 9 (1974), 256-278.
28. LUND, C., FORTNOW, L., KARLOFF, H. & NISAN, N., Algebraic methods for interactive proof systems. J. ACM, 39 (1992), 859-868.
29. MOTWANI, R. & RAGHAVAN, P., Randomized Algorithms. Cambridge Univ. Press, Cambridge, 1995.
30. PAPADIMITRIOU, C., Computational Complexity. Addison-Wesley, Reading, MA, 1994.
31. PAPADIMITRIOU, C. & YANNAKAKIS, M., Optimization, approximation and complexity classes. J. Comput. System Sci., 43 (1991), 425-440.
32. RAZ, R., A parallel repetition theorem. SIAM J. Comput., 27 (1998), 763-803.
33. SHAMIR, A., IP=PSPACE. J. ACM, 39 (1992), 869-877.
34. ZUCKERMAN, D., On unapproximable versions of NP-complete problems. SIAM J. Comput., 25 (1996), 1293-1304.