Thumbnail
Access Restriction
Subscribed

Author Feige, Uriel ♦ Goldwasser, Shafi ♦ Lovsz, Laszlo ♦ Safra, Shmuel ♦ Szegedy, Mario
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1996
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Hardness of approximation ♦ Independent set in a graph ♦ Multilinearity testing np-completeness ♦ Probabilistically checkable proofs
Abstract The contribution of this paper is two-fold. First, a connection is established 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 interaction 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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1996-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 43
Issue Number 2
Page Count 25
Starting Page 268
Ending Page 292


Open content in new tab

   Open content in new tab
Source: ACM Digital Library