Interactive proofs and the hardness of approximating cliques

Uriel Feige, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra, Mario Szegedy
1996 Journal of the ACM  
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 multiprover interactive proofs, is shown to yield hardness results on the complexity of approximating the size of the
more » ... gest clique in a graph. Of independent interest is our proof of correctness for the multilinearity test of functions.
doi:10.1145/226643.226652 fatcat:hlis7vvav5bmnn34hhm3riqg4u