Title :
Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size
Author :
Hansen, Kristoffer Arnsfelt
Author_Institution :
Dept. of Comput. Sci., Univ. of Chicago, Chicago, IL
Abstract :
We revisit the computational power of constant width polynomial size planar nondeterministic branching programs. We show that they are capable of computing any function computed by a Pi2 o CC0 o AC0 circuit in polynomial size. In the quasipolynomial size setting we obtain a characterization of ACC0 by constant width planar non-deterministic branching programs.
Keywords :
polynomials; computational power; planar nondeterministic branching programs; quasipolynomial size; Binary decision diagrams; Circuit simulation; Computational complexity; Computational modeling; Computer science; Polynomials; Upper bound; Branching Programs; Circuits; Constant Width; Planarity;
Conference_Titel :
Computational Complexity, 2008. CCC '08. 23rd Annual IEEE Conference on
Conference_Location :
College Park, MD
Print_ISBN :
978-0-7695-3169-4
DOI :
10.1109/CCC.2008.30
