R Impagliazzo, A Wigderson - Journal of Computer and System Sciences, 2001 - Elsevier
We prove that if BPP≠ EXP, then every problem in BPP can be solved deterministically in
subexponential time on almost every input (on every sampleable ensemble for infinitely …