Author:
Barrington David Mix,McKenzie Pierre,Moore Cris,Tesson Pascal,Thérien Denis
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. D. A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci., 38(1):150–164, Feb. 1989.
2. D. A. M. Barrington, H. Straubing, and D. Thérien. Non-uniform automata over groups. Information and Computation, 89(2):109–132, Dec. 1990.
3. S. Eilenberg. Automata, Languages and Machines. Academic Press, 1976.
4. M. Goldmann and A. Russell. The complexity of solving equations over finite groups. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity (CCC-99), pages 80–86, 1999.
5. P. McKenzie, P. Péladeau, and D. Thérien. NC1: The automata theoretic viewpoint. Computational Complexity, 1:330–359, 1991.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献