Circuits on Cylinders

  • Kristoffer Arnsfelt Hansen
  • Peter Bro Miltersen
  • V. Vinay
Conference paper

DOI: 10.1007/978-3-540-45077-1_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2751)
Cite this paper as:
Hansen K.A., Miltersen P.B., Vinay V. (2003) Circuits on Cylinders. In: Lingas A., Nilsson B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg

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 \({\bf \prod}_2 \circ {\bf MOD} \circ {\bf 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 ACC0.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Kristoffer Arnsfelt Hansen
    • 1
  • Peter Bro Miltersen
    • 1
  • V. Vinay
    • 2
  1. 1.Department of Computer ScienceUniversity of AarhusDenmark
  2. 2.Indian Institute of ScienceBangaloreIndia

Personalised recommendations