Sciweavers

FOCS
1995
IEEE
15 years 11 days ago
Pseudorandom Generators, Measure Theory, and Natural Proofs
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
65
Voted
RANDOM
1997
Springer
15 years 28 days ago
Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
Steven M. Kautz