Abstract
We generalize resource-bounded Baire's categories to small complexity classes such as P, QP and SUBEXP and to probabilistic classes such as BPP. We give an alternative characterization of small sets via resource-bounded Banach-Mazur games. As an application we show that for almost every language A ∈ SUBEXP, in the sense of Baire's category, PA = BPPA. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Moser, P. (2003). Baire’s categories on small complexity classes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2751, 333–342. https://doi.org/10.1007/978-3-540-45077-1_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free