The Lower Reaches of Circuit Uniformity

The effect of severely tightening the uniformity of Boolean circuit families is investigated. The impact on NC1 and its subclasses is shown to depend on the characterization chosen for the class, while classes such as P appear to be more robust. Tightly uniform subclasses of NC1 whose separation may be within reach of current techniques emerge.

[1]  A BarringtonDavid.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1989 .

[2]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[3]  Thomas Schwentick,et al.  The Descriptive Complexity Approach to LOGCFL , 1998, J. Comput. Syst. Sci..

[4]  Samuel R. Buss,et al.  An Optimal Parallel Algorithm for Formula Evaluation , 1992, SIAM J. Comput..

[5]  Heribert Vollmer,et al.  Introduction to Circuit Complexity , 1999, Texts in Theoretical Computer Science An EATCS Series.

[6]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[7]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[8]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[9]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[10]  Heribert Vollmer,et al.  Introduction to Circuit Complexity: A Uniform Approach , 2010 .

[11]  W. Thomas.  The theory of successor with an extra predicate , 1978 .

[12]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[13]  Eric Allender,et al.  P-uniform circuit complexity , 1989, JACM.

[14]  Heribert Vollmer,et al.  Extensional Uniformity for Boolean Circuits , 2008, SIAM J. Comput..

[15]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[16]  Christoph Behle,et al.  FO[<]-uniformity , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[17]  Howard Straubing,et al.  Definability of Languages by Generalized First-Order Formulas over (N, +) , 2006, STACS.

[18]  Stephen A. Cook,et al.  Deterministic CFL's are accepted simultaneously in polynomial time and log squared space , 1979, STOC.

[19]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[20]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[21]  Andreas Krebs,et al.  Non-definability of Languages by Generalized First-order Formulas over (N,+) , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[22]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[23]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[24]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..