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, P A = BPP A.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lutz, J.: Category and measure in complexity classes. SIAM Journal on Computing 19, 1100–1131 (1990)
Lutz, J.: Almost everywhere high nonuniform complexity. Journal of Computer and System Science 44, 220–258 (1992)
Allender, E., Strauss, M.: Measure on small complexity classes, with application for BPP. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 807–818 (1994)
Strauss, M.: Measure on P-strength of the notion. Inform. and Comp. 136(1), 1–23 (1997)
Regan, K., Sivakumar, D.: Probabilistic martingales and BPTIME classes. In: Proc. 13th Annual IEEE Conference on Computational Complexity, pp. 186–200 (1998)
Moser, P.: A generalization of Lutz’s measure to probabilistic classes (2002) (submitted)
Ambos-Spies, K.: Resource-bounded genericity. In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, pp. 162–181 (1995)
Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. EATCS Monographs on Theorical Computer Science, vol. 11. Springer, Heidelberg (1995)
Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity II. EATCS Monographs on Theorical Computer Science, vol. 22. Springer, Heidelberg (1990)
Papadimitriou, C.: Computational complexity. Addison-Wesley, Reading (1994)
Klivans, A., Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 659–667 (1999)
Impagliazzo, R., Widgerson, A.: P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 220–229 (1997)
Moser, P.: Locally computed Baire’s categories on small complexity classes (2002) (submitted)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moser, P. (2003). Baire’s Categories on Small Complexity Classes. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-45077-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40543-6
Online ISBN: 978-3-540-45077-1
eBook Packages: Springer Book Archive