Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Agrawal, M., Allender, E., Datta, S.: On TC0, AC0, and arithmetic circuits. In: Proceedings 12th Computational Complexity, pp. 134–148. IEEE Computer Society Press, Los Alamitos (1997)
2. Allender, E.: Making computation count: arithmetic circuits in the nineties. SIGACT News 28(4), 2–15 (1998)
3. Lecture Notes in Computer Science;E. Allender,1999
4. Allender, E., Jiao, J., Mahajan, M., Vinay, V.: Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theoretical Computer Science 209, 47–86 (1998)
5. Allender, E., Ogihara, M.: Relationships among PL, #L, and the determinant. RAIRO – Theoretical Informatics and Applications 30, 1–21 (1996)