Counting Classes and the Fine Structure between NC1 and L
The class NC 1of problems solvable by bounded fan-in circuit families of logarithmic depth is known to be contained in logarithmic space L, but not much about the converse is known. In this paper we examine the structure of classes in between NC 1 and L based on counting functions or, equivalently, based on arithmetic circuits. The classes PNC 1 and C = NC 1, defined by a test for positivity and a test for zero, respectively, of arithmetic circuit families of logarithmic depth, sit in this complexity interval. We study the landscape of Boolean hierarchies, constant-depth oracle hierarchies, and logarithmic-depth oracle hierarchies over PNC 1 and C = NC 1. We provide complete problems, obtain the upper bound L for all these hierarchies, and prove partial hierarchy collapses—in particular, the constant-depth oracle hierarchy over PNC 1 collapses to its first level PNC 1, and the constant-depth oracle hierarchy over C = NC 1 collapses to its second level.
KeywordsLanguage Class Arithmetic Circuit Polynomial Size Boolean Circuit Output Gate
Unable to display preview. Download preview PDF.
- 1.Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajicek, J. (ed.) Complexity of Computations and Proofs. Quaderni di Matematica, vol. 13, pp. 33–72. Seconda Universita di Napoli (2004); An earlier version appeared in the Complexity Theory Column. SIGACT News 28(4), 2–15 (December 1997)Google Scholar
- 6.Caussinus, H., McKenzie, P., Thérien, D., Vollmer, H.: Nondeterministic NC 1 computation. Journal of Computer and System Sciences 57, 200–212 (1998); Preliminary version in Proceedings of the 11th IEEE Conference on Computational Complexity, pp. 12–21 (1996)Google Scholar
- 10.Mahajan, M., Raghavendra Rao, B.V.: Small-space analogues of Valiant’s classes. In: Gȩbala, M. (ed.) FCT 2009. LNCS, vol. 5699, pp. 250–261. Springer, Heidelberg (2009)Google Scholar
- 12.Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, New York (1999)Google Scholar