Probabilistic complexity theory - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2009-04-05 12:14:36 Probabilistic complexity theory Pseudorandomness Algorithmic information theory Pseudorandom generator Average-case complexity Information-theoretic security Randomized algorithm Russell Impagliazzo List decoding Theoretical computer science Applied mathematics Computational complexity theory		Add to Reading List Source URL: www1.cs.columbia.edu Download Document from Source Website File Size: 122,17 KB Share Document on Facebook

	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA DocID: 1xViX - View Document
	Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA DocID: 1vs6Y - View Document
	P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma Russell Impagliazzo∗ Avi Wigderson† Department of Computer Science Institute of Computer Science University of California DocID: 1uymj - View Document
	Pseudorandomness for Network Algorithms Russell Impagliazzo ∗ Noam Nisan DocID: 1unPp - View Document
	EATCS-IPEC Nerode Prize 2013 On the Exact Complexity of Evaluating Quantified k-CNF Chris Calabro, Russell Impagliazzo, Ramamohan Paturi, Algorithmica 2013 The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs DocID: 1m4oG - View Document