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
UPDATE