Some Results on Derandomization

Harry Buhrman, Lance Fortnow, Aduri Pavan

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.