Authors
Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell
Publication date
1993/6/1
Book
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Pages
294-304
Description
We construct multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size. As a consequence, we obtain asymptotic improvements to approximation hardness results for a wide range of optimization problems including minimum set cover, dominating set, maximum clique, chromatic number, and quartic programming; and constant factor improvements on the hardness results for MAXSNP problems. In particular, we show that approximating minimum set cover within any constant is NP-complete; approximating minimum set cover within c log n, for c< 1/8, implies NP C DTIME (nlOglOgn); approximat-—ing the maximum of a quartic program within any constant is NP-complete; approximating maximum clique or chromatic number within nl/29 implies NP~ BPP; and approximating MAX-3 SAT within 113/112 is NP-complete.
Total citations
1992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242935333130291614139910101413815141212101412191455891183
Scholar articles
M Bellare, S Goldwasser, C Lund, A Russell - Proceedings of the twenty-fifth annual ACM symposium …, 1993
M Bellare, S Goldwasser, C Lund, A Russell - Proceedings of the twenty-sixth annual ACM …, 1994
M Bellare, S Goldwasser, C Lund, A Russel - Proc. 25th Annu. Symp. Theory Comput