Constant width planar computation characterizes ACC0

Theory of Computing Systems

Volumn 39, Issue 1, 2006, Pages 79-92

  Hansen, Kristoffer Arnsfelt ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC DIGRAPH; CONSTANT-WIDTH CIRCUITS; CYLINDER SURFACE; PLANAR CIRCUIT; POLYNOMIAL SIZE;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

CYLINDERS (SHAPES);

EID: 30744448407     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1258-7     Document Type: Conference Paper

References (19)

1. 1. In Proceedings of the 20th Annual IEEE Conference on Computational Complexity, pages 298-307. IEEE Computer Society Press, Los Alamitos, CA, 2005.
2. 1. J. Comput. System Sci., 38(1):150-164, 1989.
3. 0 hierarchy. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pages 73-83, 1998.
4. D. A. M. Barrington, C.-J. Lu, P. B. Miltersen, and S. Skyum. On monotone planar circuits. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pages 24-31. IEEE Computer Society Press, Los Alamitos, CA, 1999.
5. 1. J. ACM, 35(4):941-952, 1988.
6. G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61(2-3): 175-198, 1988.
7. D. Edmonds. A combinatorial representation for polyhedral surfaces. Notices Amer. Math. Soc., 7:646, 1960.
8. H. D. Gröger. A new partition lemma for planar graphs and its application to circuit complexity. In Proceedings of the 8th International Symposium on Fundamentals of Computation Theory, pages 220-229. Volume 529 of Lecture Notes in Computer Science. Springer, Berlin, 1991.
9. K. A. Hansen, P. B. Miltersen, and V. Vinay. Circuits on cylinders. Technical Report 66, Electronic Colloquium on Computational Complexity, 2002.
10. K. A. Hansen, P. B. Miltersen, and V. Vinay. Circuits on cylinders. In Proceedings of the 14th International Symposium on Fundamentals of Computation Theory, pages 171-182. Volume 2751 of Lecture Notes in Computer Science. Springer, Berlin, 2003.
11. D. Kelly. Fundamentals of planar ordered sets. Discrete Math., 63(2,3):197-216, 1987.
12. R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM J. Comput., 9(3):615-627, August 1980.
13. R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(1):312-341, 1986.
14. R. Tamassia and I. G. Tollis. Tessellation representations of planar graphs. In Proceedings of the 27th Annual Allerton Conference on Communications, Control and Computing, pages 48-57. University of Illinois at Urbana-Champaign, September 1989.
15. R. Tamassia and I. G. Tollis. Representations of graphs on a cylinder. SIAM J. Discrete Math., 4(1): 139-149, 1991.
16. G. Turán. On restricted boolean circuits. In Proceedings of the 7th International Symposium on Fundamentals of Computation Theory, pages 460-469. Volume 380 of Lecture Notes in Computer Science. Springer, Berlin, 1989.
17. V. Vinay. Hierarchies of circuit classes that are closed under complement. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 108-117. IEEE Computer Society Press, Los Alamitos, CA, 1996.
18. A. T. White. Graphs, Groups and Surfaces. Elsevier, Amsterdam, 1984.
19. A. C.-C. Yao. On ACC and threshold circuits. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 619-627. IEEE Computer Society Press, Los Alamitos, CA, 1990.