Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139

First Page		Document Content
Date: 2010-05-13 09:33:41 Structural complexity theory Complexity classes Models of computation Lance Fortnow Probabilistic complexity theory Interactive proof system IP Bounded-error probabilistic polynomial Probabilistic Turing machine Theoretical computer science Computational complexity theory Applied mathematics		Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139 Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 84,83 KB Share Document on Facebook

	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rgbF - View Document
	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 DocID: 1raDV - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1r8mX - View Document
	An Eﬃcient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant DocID: 1qOst - View Document
	JOURNAL OF COMPUTER AND SYSTEM SCIENCES DocID: 1qf4Y - View Document