Author:
Hansen Kristoffer Arnsfelt
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. System Sci. 38(1), 150–164 (1989)
2. Mix Barrington, D.A., 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)
3. Mix Barrington, D.A., 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)
4. Mix Barrington, D.A., Thérien, D.: Finite monoids and the fine structure of NC1. Journal of the ACM (JACM) 35, 941–952 (1988)
5. Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science 61(2-3), 175–198 (1988)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献