Abstract
We show several results about derandomization including: 1. If NP is easy on average then efficient pseudorandom generators exist and P=BPP. 2. If NP is easy on average then given an NP machine M we can easily on average find accepting computations of M(x) when it accepts. 3. For any A in EXP, if NEXPA is in PA/poly then NEXPA=EXPA. 4.If A is Σpk and NEXPA is in PA/poly then NEXPA=EXP=MAA.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Buhrman, H., Fortnow, L. & Pavan, A. Some Results on Derandomization. Theory Comput Syst 38, 211–227 (2005). https://doi.org/10.1007/s00224-004-1194-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1194-y