The Global Power of Additional Queries to p-Random Oracles
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Baire Category and Nowhere Differentiability for Feasible Real Functions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Bias Invariance of Small Upper Spans
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Martingale families and dimension in P
Theoretical Computer Science
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
A zero-one SUBEXP-dimension law for BPP
Information Processing Letters
Axiomatizing resource bounds for measure
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Martingale families and dimension in p
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Dimension characterizations of complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.02 |
We present a notion of resource-bounded measure for P and other subexponential-time classes. This generalization is based on Lutz's notion of measure, but overcomes the limitations that cause Lutz's definitions to apply only to classes at least as large as E. We present many of the basic properties of this measure, and use it to explore the class of sets that are hard for BPP. Bennett and Gill showed that almost all sets are hard for BPP; Lutz improved this from Lebesgue measure to measure on ESPACE. We use our measure to improve this still further, showing that for all /spl epsiv/0, almost every set in E/sub /spl epsiv// is hard for BPP, where E/sub /spl epsiv//=/spl cup//sub /spl delta/