Back to Results
First PageMeta Content
Complexity classes / Probabilistic complexity theory / Mathematical optimization / Mathematical proofs / Interactive proof system / NP / Probabilistically checkable proof / P versus NP problem / MAX-3SAT / Theoretical computer science / Computational complexity theory / Applied mathematics


Interactive Proofs and the Hardness of Approximating Cliques Uriel Feige ∗
Add to Reading List

Document Date: 2007-01-10 14:31:22

Open Document

File Size: 244,61 KB

Share Result on Facebook

City

Cambridge / New Haven / Motwani / /

Company

3SAT / CNF / AT&T Bell Labs / /

Country

Israel / Sudan / /

Currency

pence / /

Event

Person Communication and Meetings / /

Facility

Princeton University / Tel Aviv University / Weizmann Institute / Yale University / /

IndustryTerm

multi-prover protocol / multi-prover interactive protocol / good approximation algorithm / polynomial time algorithm / interactive proof systems / multi-prover interactive proof systems / approximation algorithms / /

Organization

Department of Applied Math and Computer Science / Weizmann Institute / Department of Computer Science / MIT / Princeton University / Department of Electrical Engineering and Computer Science / Yale University / Tel Aviv University / Tel Aviv / /

Person

Laszlo Lovasz / Murray Hill / Shmuel Safra Mario Szegedy / Shafi Goldwasser / MAX CLIQUE / MAX NP / Uriel Feige / /

Position

author / /

ProvinceOrState

New Jersey / Massachusetts / Connecticut / /

Technology

polynomial time algorithm / 3 Multi-Prover Protocols / multi-prover interactive protocol / good approximation algorithm / approximation algorithms / 2 Multi-Prover Protocols / SNP / multi-prover protocol / /

SocialTag