| M. Strauss. Normal numbers and sources for BPP, |
....of languages that appear random to all 2 n c time bounded machines has measure one in EXP. Lutz [15] showed a measure one class in which every member is a pseudorandom source for BPP, and Allender and Strauss [1] extended this for measures on DTIME[2 n e ] for every e 0. Related work is [14, 18, 11, 12, 20, 31]. Our main theorem relates a measure question directly to PSRGs and the class P poly of languages having polynomial sized circuits: Theorem 1 If strong PSRGs exist, then P poly is not measurable in EXP. Here strong means that there exists some e 0 such that the PSRG is secure against 2 n e ....
M. Strauss. Normal numbers and sources for BPP,
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC