Counting classes and the fine structure between NC1and L

Authors:
Samir Datta;Meena Mahajan;B. V. Raghavendra Rao;Michael Thomas;Heribert Vollmer
Affiliations:
Chennai Mathematical Institute, India;The Institute of Mathematical Sciences, Chennai, India;Universität des Saarlandes, Saarbrücken, Germany;Leibniz Universität, Hannover, Germany;Leibniz Universität, Hannover, Germany
Venue:
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Year:
2010

Citing 11
Cited 2

Relativized circuit complexity

Journal of Computer and System Sciences
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Boolean circuits versus arithmetic circuits

Information and Computation
Unambiguity of circuits

Theoretical Computer Science - Special issue on structure in complexity theory
PP is closed under intersection

Selected papers of the 23rd annual ACM symposium on Theory of computing
PP is closed under truth-table reductions

Information and Computation
The PL Hierarchy Collapses

SIAM Journal on Computing
The complexity of matrix rank and feasible systems of linear equations

Computational Complexity
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
Nondeterministic NC1 Computation

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Small-space analogues of Valiant's classes

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory

Succinct algebraic branching programs characterizing non-uniform complexity classes

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Counting classes and the fine structure between NC1 and L

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The class NC1 of 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 NC1 and L based on counting functions or, equivalently, based on arithmetic circuits. The classes PNC1 and C=NC1, 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 PNC1 and C=NC1. 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 PNC1 collapses to its first level PNC1, and the constant-depth oracle hierarchy over C=NC1 collapses to its second level.