Author:
Beaudry Martin,McKenzie Pierre,Péladeau Pierre
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. C. Àlvarez and B. Jenner, A very hard log space counting class, Proc. of the 5th IEEE Structure in Complexity Theory Conference (1990), pp. 154–168.
2. D.A. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, J. Computer and Systems Science38 (1989), pp. 150–164.
3. D.A.M. Barrington, N. Immerman and H. Straubing, On uniformity within NC1, J. Computer and Systems Science41 (1990), pp. 274–306.
4. D.A. Barrington, H. Straubing and D. Thérien, Non-Uniform Automata Over Groups, Information and Computation89, 2 (1990), pp. 109–132.
5. D.A. Barrington and D. Thérien, Finite Monoids and the Fine Structure of NC1, J. of the Association for Computing Machinery35 (1988), pp. 941–952.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献