Topology inside NC/sup 1/

We show that ACC/sup 0/ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC/sup 0/. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that thickness two already suffices to capture all of NC/sup 1/.

[1]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[2]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

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

[4]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

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

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

[7]  Frank Harary,et al.  Graph Theory , 2016 .

[8]  Andris Ambainis,et al.  Bounded Depth Arithmetic Circuits: Counting and Closure , 1999, ICALP.

[9]  Denis Thérien,et al.  NC1: The automata-theoretic viewpoint , 1991, computational complexity.

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

[11]  Howard Straubing,et al.  Regular Languages in NC¹ , 1992, J. Comput. Syst. Sci..

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

[13]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[14]  BarringtonDavid A. Mix,et al.  Regular languages in NC1 , 1992 .

[15]  Eric Allender,et al.  On TC0, AC0, and Arithmetic Circuits , 2000, J. Comput. Syst. Sci..

[16]  David A. Mix Barrington,et al.  Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ , 1989, J. Comput. Syst. Sci..