|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
577
|
Approximation algorithms for combinatorial problems
– D Johnson
- 1974
|
|
335
|
On the hardness of approximating minimization problems
– C Lund, M Yannakakis
- 1994
|
|
506
|
Optimization, approximation and complexity classes
– C H Papadimitriou, M Yannakakis
- 1991
|
|
217
|
On the ratio of optimal integral and fractional covers
– L Lovasz
- 1975
|
|
561
|
Some optimal inapproximability results
– Johan Håstad
- 2002
|
|
319
|
Probabilistic checking of proofs: a new characterization of NP
– Sanjeev Arora
- 1998
|
|
221
|
Approximation Algorithms for Connected Dominating Sets
– Sudipto Guha, Samir Khuller
- 1996
|
|
969
|
Geometric Algorithms and Combinatorial Optimization
– M Grötschel, L Lovász, A Schrijver
- 1993
|
|
268
|
Algebraic Methods for Interactive Proof Systems
– Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan
- 1990
|
|
110
|
Improved Non-Approximability Results
– Mihir Bellare, Madhu Sudan
- 1994
|
|
221
|
Checking Computations in Polylogarithmic Time
– László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
- 1991
|
|
267
|
Trading Group Theory for Randomness
– László Babai
- 1985
|
|
356
|
Non-Deterministic Exponential Time has Two-Prover Interactive Protocols
– Laszlo Babai, Lance Fortnow, Carsten Lund
|
|
194
|
M.Szegedy. Proof verification and intractability of approximation problems
– S Arora, C Lund, R Motwani, M Sudan
- 1998
|
|
116
|
On the Power of Multi-Prover Interactive Protocols
– Lance Fortnow, John Rompel, Michael Sipser
- 1988
|
|
247
|
A Parallel Repetition Theorem
– Ran Raz
- 1998
|
|
147
|
A local-ratio theorem for approximating the weighted vertex cover problem
– R Bar-Yehuda, S Even
|
|
125
|
Interactive proofs and the hardness of approximating cliques
– Uriel Feige, Shafi Goldwasser, Laszlo Lovasz, Shmuel Safra, Mario Szegedy
- 1996
|
