Author:
McKenzie Pierre,Wagner Klaus W.
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. M. Agrawal, E. Allender, and S. Datta, On TC0, AC0, and arithmetic circuits, J. Computer and System Sciences 60 (2000), pp. 395–421.
2. E. Allender, Making computation count: Arithmetic circuits in the Nineties, in the Complexity Theory Column, SIGACT NEWS 28 (4) (1997) pp. 2–15.
3. E. Allender, K. Reinhardt, S. Zhou, Isolation, matching, and counting: Uniform and nonuniform upper bounds, J. Computer and System Sciences 59(1999), pp. 164–181.
4. E. Allender, D. Barrington, and W. Hesse, Uniform constant-depth threshold circuits for division and iterated multiplication, Proceedings 16th Conference on Computational Complexity, 2001, pp. 150–159.
5. E. Allender, J. Jiao, M. Mahajan and V. Vinay, Non-commutative arithmetic circuits: depth-reduction and depth lower bounds, Theoretical Computer Science Vol. 209 (1/2,2) (1998), pp. 47–86.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Functions Definable by Arithmetic Circuits;Mathematical Theory and Computational Practice;2009
2. Satisfiability of Algebraic Circuits over Sets of Natural Numbers;FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science;2007
3. The complexity of membership problems for circuits over sets of integers;Theoretical Computer Science;2006-12
4. Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals;Fundamentals of Computation Theory;2005
5. Zeta-Dimension;Mathematical Foundations of Computer Science 2005;2005