Structural complexity 1
Structural complexity 2
Category and measure in complexity classes
SIAM Journal on Computing
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
SIAM Journal on Computing
Measure on P: strength of the notion
Information and Computation
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The zero-one law holds for BPP
Theoretical Computer Science
Probabilistic Martingales and BPTIME Classes
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Resource-bounded Baire category: a stronger approach
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Theoretical Computer Science
On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Martingale families and dimension in p
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Generic density and small span theorem
Information and Computation
Resource-bounded measure on probabilistic classes
Information Processing Letters
Martingale families and dimension in P
Theoretical Computer Science
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation
Hi-index | 0.00 |
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ on how the corresponding finite extension strategies are computed. We give an alternative characterization of small sets via resource-bounded Banach-Mazur games. As an application of the first notion, we show that for almost every language A (i.e. all except a meager class) computable in subexponential time, P^A=BPP^A. We also show that almost all languages in PSPACE do not have small nonuniform complexity. We then switch to the second Baire category notion (called locally-computable), and show that the class SPARSE is meager in P. We show that in contrast to the resource-bounded measure case, meager-comeager laws can be obtained for many standard complexity classes, relative to locally-computable Baire category on BPP and PSPACE. Another topic where locally-computable Baire categories differ from resource-bounded measure is regarding weak-completeness: we show that there is no weak-completeness notion in P based on locally-computable Baire categories, i.e. every P-weakly-complete set is complete for P. We also prove that the class of complete sets for P under Turing-logspace reductions is meager in P, if P is not equal to DSPACE (logn), and that the same holds unconditionally for QUASIPOLY. Finally we observe that locally-computable Baire categories are incomparable with all existing resource-bounded measure notions on small complexity classes, which might explain why those two settings seem to differ so fundamentally.