Skip to main content
Log in

Circuits on cylinders

  • Original Paper
  • Published:
computational complexity Aims and scope Submit manuscript

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 \( {\mathbf{\Pi }}_{\mathbf{2}} \; \circ \;{\mathbf{MOD}}\; \circ \;{\mathbf{AC}}{^0 } \) 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 ACC 0.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kristoffer Arnsfelt Hansen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hansen, K.A., Miltersen, P.B. & Vinay, V. Circuits on cylinders. comput. complex. 15, 62–81 (2006). https://doi.org/10.1007/s00037-006-0207-4

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-006-0207-4

Keywords.

Subject classification.

Navigation