Documents Related by Co-Citation

637 Some optimal inapproximability results – Johan Håstad - 2002
170 Efficient probabilistically checkable proofs and applications to approximation – M. Bellare, S. Goldwassert, C. Lundi, A. Russell - 1993
357 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
311 A Parallel Repetition Theorem – Ran Raz - 1998
394 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund
704 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
256 Checking Computations in Polylogarithmic Time – László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy - 1991
335 Self-Testing/Correcting with Applications to Numerical Problems – Manuel Blum, Michael Luby, Ronitt Rubinfeld - 1990
149 Interactive proofs and the hardness of approximating cliques – Uriel Feige, Shafi Goldwasser, Laszlo Lovasz, Shmuel Safra, Mario Szegedy - 1996
380 On the hardness of approximating minimization problems – C Lund, M Yannakakis - 1994
116 Improved Non-Approximability Results – Mihir Bellare, Madhu Sudan - 1994
34 Testing of the long code and hardness for clique – J Hastad - 1996
565 Optimization, Approximation and Complexity Classes – C H Papadimitriou, M Yannakakis - 1991
318 Robust Characterizations of Polynomials with Applications to Program Testing – Ronitt Rubinfeld, Madhu Sudan - 1996
208 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 - 1999
678 Approximation algorithms for combinatorial problems – D S Johnson - 1973
19 Ecient probabilistically checkable proofs – M Bellare, S Goldwasser, C Lund, A Russell - 1993
92 Two-prover one-round proof systems: their power and their problems (Extended Abstract) – Uriel Feige , Laszlo Lovasz - 1992