DMCA
Interactive proofs and the hardness of approximating cliques (1996)
Cached
Download Links
- [www.cs.elte.hu]
- [www.wisdom.weizmann.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | JOURNAL OF THE ACM |
| Citations: | 170 - 11 self |
BibTeX
@ARTICLE{Feige96interactiveproofs,
author = {Uriel Feige and Shafi Goldwasser and Laszlo Lovasz and Shmuel Safra and Mario Szegedy},
title = {Interactive proofs and the hardness of approximating cliques},
journal = {JOURNAL OF THE ACM},
year = {1996},
volume = {43},
pages = {268--292}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The contribution of this paper is two-fold. First, a connection is shown between approximating the size of the largest clique in a graph and multi-prover interactive proofs. Second, an efficient multi-prover interactive proof for NP languages is constructed, where the verifier uses very few random bits and communication bits. Last, the connection between cliques and efficient multi-prover interactive proofs, is shown to yield hardness results on the complexity of approximating the size of the largest clique in a graph. Of independent interest is our proof of correctness for the multilinearity test of functions.
