Lance Jeremy Fortnow Georgia Institute of Technology School of Computer Science 266 Ferst Drive Atlanta, GA 30332

First Page		Document Content
Date: 2014-06-05 11:48:59 Carsten Lund Computational learning theory Sparse language IP ACM SIGACT Computer science International Colloquium on Automata Languages and Programming Interactive proof system Probabilistically checkable proof Theoretical computer science Applied mathematics Computational complexity theory		Lance Jeremy Fortnow Georgia Institute of Technology School of Computer Science 266 Ferst Drive Atlanta, GA 30332 Add to Reading List Source URL: lance.fortnow.com Download Document from Source Website File Size: 200,67 KB Share Document on Facebook

	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document
	SelectNet_Manual_v2_April_2012.pdf DocID: 1qMoc - View Document
	WV Public Employees Insurance Agency Frequently Asked Questions on Picking a Primary Care Provider Q. Why is PEIA making me pick a physician? DocID: 1qjEP - 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
	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 DocID: 1mroB - View Document