Documents Related by Co-Citation

561 Some optimal inapproximability results – Johan Håstad - 2002
161 Efficient probabilistically checkable proofs and applications to approximation – M. Bellare, S. Goldwassert, C. Lundi, A. Russell - 1993
319 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
605 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
247 A Parallel Repetition Theorem – Ran Raz - 1998
506 Optimization, approximation and complexity classes – C H Papadimitriou, M Yannakakis - 1991
356 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund
125 Interactive proofs and the hardness of approximating cliques – Uriel Feige, Shafi Goldwasser, Laszlo Lovasz, Shmuel Safra, Mario Szegedy - 1996
335 On the hardness of approximating minimization problems – C Lund, M Yannakakis - 1994
110 Improved Non-Approximability Results – Mihir Bellare, Madhu Sudan - 1994
33 Testing of the long code and hardness for clique – J H˚astad - 1996
221 Checking Computations in Polylogarithmic Time – László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy - 1991
298 Self-Testing/Correcting with Applications to Numerical Problems – Manuel Blum, Michael Luby, Ronitt Rubinfeld - 1990
19 Ecient probabilistically checkable proofs and applications to approximation – M Bellare, S Goldwasser, C Lund, A Russell - 1993
194 M.Szegedy. Proof verification and intractability of approximation problems – S Arora, C Lund, R Motwani, M Sudan - 1998
67 Clique is hard to approximate within n 1\Gammaffl – J Hastad - 1996
577 Approximation algorithms for combinatorial problems – D Johnson - 1974
773 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
27 Some optimal inapproximability results – J H ˚ASTAD - 1997