Proof verification and hardness of approximation problems (1992)

by Sanjeev Arora , Carsten Lund , Rajeev Motwani , Madhu Sudan , Mario Szegedy
Venue:In Proc. 33rd Ann. IEEE Symp. on Found. of Comp. Sci
Citations:710 - 45 self

Documents Related by Co-Citation

577 Optimization, approximation and complexity classes – C Papadimitriou, M Yannakakis - 1991
365 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
390 On the hardness of approximating minimization problems – C Lund, M Yannakakis - 1994
187 Approximating clique is almost NP-complete – U Feige, S Goldwasser, L Lovasz, S Safra, M Szegedy - 1991
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
402 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund
208 Free Bits, PCPs and Non-Approximability -- Towards Tight Results – Mihir Bellare, Oded Goldreich, Madhu Sudan - 1996
682 Approximation Algorithms for Combinatorial Problems – D S Johnson - 1974
1161 Geometric Algorithms and Combinatorial Optimization – M Grotschel, L Lovasz, A Schrijver - 1993
305 Algebraic Methods for Interactive Proof Systems – Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan - 1990
96 Two-prover one-round proof systems: their power and their problems – Uriel Feige L, Z Lov, Z F L Vp - 1992
180 Approximate graph coloring by semidefinite programming – David Karger, Rajeev Motwani, Madhu Sudan - 1994
67 Clique is hard to approximate within n 1\Gammaffl – J Hastad - 1999
70 878-approximation algorithms for max cut and max 2sat – M X Goemans, D P Williamson - 1994
648 Some optimal inapproximability results – Johan Håstad - 2002
152 Interactive proofs and the hardness of approximating cliques – Uriel Feige, Shafi Goldwasser, Laszlo Lovasz, Shmuel Safra, Mario Szegedy - 1996
175 Efficient probabilistically checkable proofs and applications to approximation – M. Bellare, S. Goldwassert, C. Lundi, A. Russell - 1993
162 Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION – Alan Frieze, For Max, Mark Jerrum - 1994
365 The ellipsoid method and its consequences in combinatorial optimization – M Grotschel, L Lovasz, A Schrijver - 1981