Author:
Behle Christoph,Krebs Andreas,Lange Klaus-Jörn,McKenzie Pierre
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Allender, E.: P-uniform circuit complexity. J. ACM 36(4), 912–928 (1989)
2. Mix Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38(1), 150–164 (1989)
3. Buss, S.R., Cook, S., Gupta, A., Ramachandran, V.: An optimal parallel algorithm for formula evaluation. SIAM J. Comput. 21(4), 755–780 (1992)
4. Mix Barrington, D.A., Immerman, N., Straubing, H.: On Uniformity within NC1. J. Comput. Syst. Sci. 41(3), 274–306 (1990)
5. Behle, C., Lange, K.-J.: FO[<]-Uniformity. In: IEEE Conference on Computational Complexity, pp. 183–189 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献