Circuits on Cylinders

We consider the computational power of constant width polynomial size cylindrical circuits and nondeterministic branching programs. We show that every function computed by a \({\bf \prod}_2 \circ {\bf MOD} \circ {\bf AC}^0\) circuit can also be computed by a constant width polynomial size cylindrical nondeterministic branching program (or cylindrical circuit) and that every function computed by a constant width polynomial size cylindrical circuit belongs to ACC 0.

[1]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

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

[4]  Gábor Tardos,et al.  Lower Bounds for (MODp-MODm) Circuits , 2000, SIAM J. Comput..

[5]  Kristoffer Arnsfelt Hansen Constant Width Planar Computation Characterizes ACC0 , 2004, STACS.

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

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

[8]  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).