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 ACC 0.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. System Sci. 38(1), 150–164 (1989)
Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: Searching constant width mazes captures the AC0 hierarchy. In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pp. 73–83 (1998)
Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: On monotone planar circuits. In: 14th Annual IEEE Conference on Computational Complexity, pp. 24–31. IEEE Computer Society Press, Los Alamitos (1999)
Barrington, D.A.M., Thérien, D.: Finite monoids and the fine structure of NC1. Journal of the ACM (JACM) 35(4), 941–952 (1988)
Grolmusz, V., Tardos, G.: Lower bounds for (modp − modm) circuits. SIAM Journal on Computing 29(4), 1209–1222 (2000)
Hansen, K.A.: Constant width planar computation characterizes ACC0. Technical Report 25, Electronic Colloquium on Computational Complexity (2003)
Hansen, K.A., Miltersen, P.B., Vinay, V.: Circuits on cylinders. Technical Report 66, Electronic Colloquium on Computational Complexity (2002)
Skyum, S., Valiant, L.G.: A complexity theory based on boolean algebra. Journal of the ACM (JACM) 32(2), 484–502 (1985)
Vinay, V.: Hierarchies of circuit classes that are closed under complement. In: 11th Annual IEEE Conference on Computational Complexity, pp. 108–117. IEEE Computer Society Press, Los Alamitos (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-540-45077-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45077-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40543-6
Online ISBN: 978-3-540-45077-1
eBook Packages: Springer Book Archive