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
Simplified Derandomization of BPP Using a Hitting Set Generator
Submitted by
smcneil
on Wed, 2013-03-06 15:48
Author:
O. Goldreich
S. Vadhan
A. Wigderson
Publication:
Studies in Complexity and Cryptography, vol. 6650, pp. 59-67, 2011.
Electronic Colloquium on Computational Complexity, Volume 7, 2000.
Year:
2011
Hide
Files
File:
Journal Version (pdf)
‹ Search Problems in Algebraic Complexity, GCT, and Hardness of Generator for Invariant Rings
up
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions ›