Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
P=BPP unless E has Subexponential Circuits: Derandomizing the XOR Lemma
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
R. Impagliazzo
A. Wigderson
Publication:
Proceedings of the 29th Symposium on Theory of Computing (STOC), pp. 220-229, 1997.
Year:
1997
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/iw97.pdf
Hide
Files
File:
Proceedings version (pdf)
Proceedings version (ps)
‹ P, NP and Mathematics - a computational complexity perspective
up
Perfect Hashing, Graph Entropy and Circuit Complexity ›