Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review
Constant Width Planar Computation Characterizes ACC0. / Hansen, K.A.
STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004. Proceedings. ed. / Volker Diekert; Michel Habib. Springer, 2004. p. 44-55 (Lecture Notes in Computer Science, Vol. 2996).Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review
}
TY - GEN
T1 - Constant Width Planar Computation Characterizes ACC0
AU - Hansen, K.A.
PY - 2004
Y1 - 2004
N2 - We obtain a characterization of ACC 0 in terms of a natural class of constant width circuits, namely in terms of constant width polynomial size planar circuits. This is shown via a characterization of the class of acyclic digraphs which can be embedded on a cylinder surface in such a way that all arcs flow along the same direction of the axis of the cylinder.
AB - We obtain a characterization of ACC 0 in terms of a natural class of constant width circuits, namely in terms of constant width polynomial size planar circuits. This is shown via a characterization of the class of acyclic digraphs which can be embedded on a cylinder surface in such a way that all arcs flow along the same direction of the axis of the cylinder.
U2 - 10.1007/978-3-540-24749-4_5
DO - 10.1007/978-3-540-24749-4_5
M3 - Article in proceedings
T3 - Lecture Notes in Computer Science
SP - 44
EP - 55
BT - STACS 2004
A2 - Diekert, Volker
A2 - Habib, Michel
PB - Springer
Y2 - 25 March 2007 through 27 March 2007
ER -