Computational Complexity Fifteenth Annual IEEE Conference ADVANCE REGISTRATION FORM

First Page		Document Content
Date: 2012-08-02 12:27:54 ACM SIGACT Lance Fortnow Average-case complexity Russell Impagliazzo Decision tree model Quantum information science Computer science Richard Cleve Complexity Theoretical computer science Applied mathematics Computational complexity theory		Computational Complexity Fifteenth Annual IEEE Conference ADVANCE REGISTRATION FORM Add to Reading List Source URL: computationalcomplexity.org Download Document from Source Website File Size: 153,08 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