Skip to main content
Log in

Some Results on Derandomization

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Harry Buhrman, Lance Fortnow or A. Pavan.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-004-1194-y

Keywords

Navigation