Title :
Topology inside NC1
Author :
Allender, Eric ; Datta, Samir ; Roy, Sambuddha
Author_Institution :
Rutgers Univ., New Brunswick, NJ, USA
Abstract :
We show that ACC0 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 ACC0. 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 NC1.
Keywords :
circuit complexity; graph theory; ACC0 characterization; NC1; constant width circuits; planarity; polylogarithmic circuits; polynomial size circuits; topology; Binary decision diagrams; Circuit topology; Complexity theory; Computational complexity; Formal languages; Polynomials; Semiconductor device modeling;
Conference_Titel :
Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on
Print_ISBN :
0-7695-2364-1
DOI :
10.1109/CCC.2005.31