Circuits on cylinders

Computational Complexity

Volumn 15, Issue 1, 2006, Pages 62-81

  Hansen, Kristoffer Arnsfelt ^a   Miltersen, Peter Bro ^a   Vinay, V ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Branching programs; Circuit complexity

Indexed keywords

EID: 33646515097     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-006-0207-4     Document Type: Article

References (9)

1. 1. J. Comput. System Sci. 38, 150-164.
2. 0 hierarchy. In Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1373, Springer, 73-83.
3. D. A. M. BARRINGTON, C.-J. LU, P. B. MILTERSEN & S. SKYUM (1999). On monotone planar circuits, in 14th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, 24-31.
4. 1. J. ACM 35, 941-952.
5. m) circuits. SIAM J. Comput. 29, 1209-1222.
6. 0. In Proc. 21st Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 2996, Springer, 44-55.
7. K. A. HANSEN, P. B. MILTERSEN & V VINAY (2003). Circuits on cylinders. In 14th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. 2751, Springer, 171-182.
8. S. SKYUM & L. G. VALIANT (1985). A complexity theory based on Boolean algebra. J. ACM 32, 484-502.
9. V VINAY (1996). Hierarchies of circuit classes that are closed under complement. In 11 th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, 108-117.