A New Characterization of ACC^0 and Probabilistic CC^0

Barrington, Straubing and Therien (1990) conjectured that the Boolean AND function can not be computed by polynomial size constant depth circuits built from modular counting gates, i.e., by CC^0 circuits. In this work we show that the AND function can be computed by uniform probabilistic CC^0 circuits that use only O(log n) random bits. This may be viewed as evidence contrary to the conjecture. As a consequence of our construction we get that all of ACC^0 can be computed by probabilistic CC^0 circuits that use only O(log n) random bits. Thus, if one were able to derandomize such circuits, we would obtain a collapse of circuit classes giving ACC^0=CC^0. We present a derandomization of probabilistic CC^0 circuits using AND and OR gates to obtain ACC^0 = AND o OR o CC^0 = OR o AND o CC^0. AND and OR gates of sublinear fan-in suffice. Both these results hold for uniform as well as non-uniform circuit classes. For non-uniform circuits we obtain the stronger conclusion that ACC^0 = rand-ACC^0 = rand-CC^0 = rand(log n)-CC^0, i.e., probabilistic ACC^0 circuits can be simulated by probabilistic CC^0 circuits using only O(log n) random bits. As an application of our results we obtain a characterization of ACC^0 by constant width planar nondeterministic branching programs, improving a previous characterization for the quasipolynomial size setting.

[1]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[2]  Kristoffer Arnsfelt Hansen,et al.  Circuits on cylinders , 2006, computational complexity.

[3]  Eric Allender,et al.  Amplifying Lower Bounds by Means of Self-Reducibility , 2008, Computational Complexity Conference.

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

[5]  Meena Mahajan,et al.  Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds , 1998, Theor. Comput. Sci..

[6]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[7]  V. Vinay.  Hierarchies of circuit classes that are closed under complement , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[8]  D. M. Barrington.  Some problems involving Razborov-Smolensky polynomials , 1992 .

[9]  Kristoffer Arnsfelt Hansen.  Constant Width Planar Computation Characterizes ACC0 , 2005, Theory of Computing Systems.

[10]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[11]  Peter Bro Miltersen,et al.  Searching Constant Width Mazes Captures the AC0 Hierarchy , 1997, STACS.

[12]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[13]  Jun Tarui.  Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy , 1993, Theor. Comput. Sci..

[14]  Peter Bro Miltersen,et al.  On monotone planar circuits , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[15]  Aravind Srinivasan,et al.  Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems , 1995, SIAM J. Comput..

[16]  Klim Efremenko,et al.  3-Query Locally Decodable Codes of Subexponential Length , 2008 .

[17]  Roman Smolensky.  On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[18]  Peter Bro Miltersen,et al.  Searching constant width mazes captures the AC 0 hierarchy , 1997 .

[19]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[20]  Emanuele Viola.  On Approximate Majority and Probabilistic Time , 2009, computational complexity.

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

[22]  Michael Ben-Or,et al.  A theorem on probabilistic constant depth Computations , 1984, STOC '84.

[23]  Clemens Lautemann,et al.  BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..

[24]  Richard Beigel,et al.  On ACC , 1994, computational complexity.

[25]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

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

[27]  Vince Grolmusz,et al.  Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs , 2000, Comb..

[28]  David A. Mix Barrington,et al.  Representing Boolean functions as polynomials modulo composite numbers , 1992, STOC '92.

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

[30]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[31]  Pavel Pudlák,et al.  Bounded-depth circuits: separating wires from gates , 2005, STOC '05.

[32]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[33]  Kristoffer Arnsfelt Hansen.  On modular counting with polynomials , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[34]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

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

[36]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[37]  Eric Allender,et al.  Depth Reduction for Circuits of Unbounded Fan-In , 1994, Inf. Comput..

[38]  Noga Alon,et al.  Derandomized graph products , 1995, computational complexity.

[39]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[40]  Denis Thérien.  Circuits Constructed with MODq Gates Cannot Compute AND in Sublinear Size , 1992, LATIN.

[41]  Denis Thérien,et al.  Non-Uniform Automata Over Groups , 1987, Inf. Comput..

[42]  Michal Koucký,et al.  Circuit Complexity of Regular Languages , 2007, Theory of Computing Systems.

[43]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[44]  Miklós Ajtai,et al.  Approximate Counting with Uniform Constant-Depth Circuits , 1990, Advances In Computational Complexity Theory.

[45]  Howard Straubing,et al.  A Note on MODp - MODm Circuits , 2006, Theory of Computing Systems.

[46]  Kristoffer Arnsfelt Hansen.  Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[47]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

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