Circuits on cylinders

Authors:
Kristoffer Arnsfelt Hansen;Peter Bro Miltersen;V. Vinay
Affiliations:
Department of Computer Science, University of Aarhus, Århus, Denmark;Department of Computer Science, University of Aarhus, Århus, Denmark;Indian Institute of Science, Bangalore, India
Venue:
Computational Complexity
Year:
2006

Citing 7
Cited 0

A complexity theory based on Boolean algebra

Journal of the ACM (JACM)
Finite monoids and the fine structure of NC1

Journal of the ACM (JACM)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Lower Bounds for (MODp - MODm) Circuits

SIAM Journal on Computing
Searching Constant Width Mazes Captures the AC0 Hierarchy

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Hierarchies of Circuit Classes that are Closed Under Complement

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
On Monotone Planar Circuits

COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the computational power of constant width polynomial size cylindrical circuits and nondeterministic branching programs. We show that every function computed by a π2 MOD C0 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 ACC0.