Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.

First Page		Document Content
Date: 2014-04-12 05:40:19 Lance Fortnow Probabilistic complexity theory BPP Probabilistically checkable proof Carsten Lund Computational complexity theory		Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192. Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 71,64 KB Share Document on Facebook

	Infeasibility of Instance Compression and Succinct PCPs for NP∗ Lance Fortnow Rahul Santhanam March 19, 2010 DocID: 1tlZ7 - View Document
	On the Complexity of Succinct Zero-Sum Games Lance Fortnow∗ Department of Computer Science University of Chicago Chicago, IL USA DocID: 1sO7L - View Document
	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document
	Computation in a Distributed Information Market Joan Feigenbaum Lance Fortnow David Pennock DocID: 1pIuU - View Document
	Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192. DocID: 1oP1q - View Document