Interactive proofs and the hardness of approximating cliques

Journal of the ACM

Volumn 43, Issue 2, 1996, Pages 268-292

  Feige, Uriel ^a   Goldwasser, Shafi ^a   Lovasz, Laszlo ^a   Safra, Shmuel ^a   Szegedy, Mario ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; THEOREM PROVING;

APPROXIMATING CLIQUES; COMMUNICATION BITS; MULTIPROVER INTERACTIVE PROOFS; RANDOM BITS;

COMPUTATIONAL METHODS;

EID: 0030100766     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/226643.226652     Document Type: Article

References (34)