Author:
Mahajan Meena,Raghavendra Rao B. V.
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Agrawal, M., Allender, E., Datta, S.: On TC0, AC0, and arithmetic circuits. Journal of Computer and System Sciences 60(2), 395–421 (2000)
2. Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajicek, J. (ed.) Complexity of Computations and Proofs, Quaderni di Matematica, vol. 13, pp. 33–72. Seconda Universita di Napoli (2004)
3. Allender, E., Ambainis, A., Barrington, D.A., Datta, S., LêThanh, H.: Bounded depth arithmetic circuits: Counting and closure. In: International Colloquium on Automata, Languages, and Programming ICALP, ICALP 1999, pp. 149–158 (1999)
4. Barrington, D.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences 38(1), 150–164 (1989)
5. Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. SIAM J. Comput. 21(1), 54–58 (1992)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献