Some recent strong inapproximability results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1432, Issue , 1998, Pages 205-209

  Håstad, Johan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR EQUATIONS;

INAPPROXIMABILITY; NP-HARD; OPTIMIZATION PROBLEMS; RECENT PROGRESS; SET SPLITTING; SYSTEM OF LINEAR EQUATIONS;

OPTIMIZATION;

EID: 27544461231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054368     Document Type: Conference Paper

References (14)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN and M. SZEGEDY. Proof verification and intractability of approximation problems. Proceedings of 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, 1992, pp 14-23.
2. S. ARORA and S. SAFRA. Probabilistic checking of proofs: a new characterization of NP. Proceedings of 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, 1992, 2-13.
3. M. BELLARE, O. GOLDREICH and M. SUDAN. Free Bits, PCPs and Non-Approximability--Towards tight Results. Proceedings of 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, Milwaukee, pp 422-431. See also a more complete version available from ECCC, Electronic Colloquium on Computational Complexity (http://www.eccc.uni-trier.de/eccc).
4. M. BELLARE, S. GOLDWASSER, C. LUND and A. RUSSELL. Efficient probabilistically checkable proofs and applications to approximation. Proceedings of the 25th Annual ACM Symposium on Theory of Computation, San Diego, 1993, pp 294-304. (See also Errata sheet in Proceedings of the 26th Annual ACM Symposium on Theory of Computation, Montreal, 1994, pp 820).
5. M. BELLARE and M. SUDAN. Improved non-approximability results. Proceedings of 26th Annual ACM Symposium on Theory of Computation, Montreal, 1994, pp 184-193.
6. M. BEN-OR, S. GOLDWASSER, J. KILIAN, and A. WIGDERSON. Multiprover interactive proofs. How to remove intractability. Proceedings of the 20th Annual ACM Symposium on Theory of Computation, Chicago, 1988, pp 113-131.
7. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, and M. SZEGEDY. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 1996, Vol 43:2, pp 268-292.
8. L. FORTNOW, J. ROMPEL, and M. SIPSER. On the power of Multi-Prover Interactive Protocols. Proceedings 3rd IEEE Symposium on Structure in Complexity Theory, pp 156-161, 1988.
9. M.R. GAREY and D.S. JOHNSSON. Computers and Intractability. W.H. Freeman and Company, 1979.
10. J. HÅSTAD. Some optimal inapproximability results. Proceedings of 29th Annual ACM Symposium on Theory of Computation, El Paso, 1997, pp 1-10. See also a more complete version available from ECCC, Electronic Colloquium on Computational Complexity (http://www.eccc.uni-trier.de/eccc).
11. D.S. JOHNSSON. Approximation algorithms for combinatorial problems. J. Computer and System Sciences, 1974, Vol 9, pp 256-278.
12. C. PAPADIMITRIOU and M. YANNAKAKIS. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, Vol 43, 1991, pp 425-440.
13. R. RAZ. A parallel repetition theorem. Proceedings of 27th Annual ACM Symposium on Theory of Computation, Las Vegas, 1995, pp 447-456.
14. L. TREVISAN, G. SORKIN, M. SUDAN, and D. WILLIAMSON. Gadgets, approximation and linear programming. Proceedings of 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, 1996, pp 617-626.