Back to Results
First PageMeta Content
Probabilistic complexity theory / Mathematical optimization / Probabilistically checkable proof / Sanjeev Arora / PCP theorem / Complexity classes / MAX-3SAT / Hardness of approximation / NP / Theoretical computer science / Applied mathematics / Computational complexity theory


Probabilistic Checking of Proofs and Hardness of Approximation Problems
Add to Reading List

Document Date: 2005-03-10 11:31:01

Open Document

File Size: 949,44 KB

Share Result on Facebook
UPDATE