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, MIT

First Page		Document Content
Date: 2012-04-12 18:03:28 Probabilistic 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, MIT Add to Reading List Source URL: people.csail.mit.edu Download Document from Source Website File Size: 503,76 KB Share Document on Facebook

	Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014 DocID: 1rrqu - View Document
	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rgbF - View Document
	Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By DocID: 1rdMz - View Document
	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 DocID: 1raDV - View Document