Date: 2012-04-12 18:03:28Probabilistic complexity theory Complexity classes Mathematical optimization Probabilistically checkable proof PCP theorem NP NEXPTIME Hardness of approximation P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics | | The Tale of the PCP Theorem How the search for the limits of computing led to the discovery of the unexpected power of proofs Dana Moshkovitz, MITAdd to Reading ListSource URL: people.csail.mit.eduDownload Document from Source Website File Size: 503,76 KBShare Document on Facebook
|