On counting ac 0 circuits with negative constants-Reference-Cited by-同舟云学术

On counting ac 0 circuits with negative constants

Published:1998 Issue: Volume: Page:409-417
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 1998
language:
Short-container-title:

Author:

Ambainis Andris,Barrington David Mix,LêThanh Huong

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055790

Reference18 articles.

1. M. Agrawal, E. Allender, S. Datta, On TC 0, AC 0 and Arithmetic Circuits. In Proceedings of the 12th Annual IEEE Conference on Computational Complexity, pp:134–148, 1997.

2. E. Allender, R. Beals, M. Ogihara, The complexity of matrix rank and feasible systems of linear equations. In Proceedings of the 28th ACM Symposium on Theory of Computing (STOC), pp:161–167, 1996.

3. C. álvarez, B. Jenner, A very hard logspace counting class. Theoretical Computer Science, 107:3–30, 1993.

4. D. A. M. Barrington, N. Immerman, Time, Hardware, and Uniformity. In L. A. Hemaspaandra and A. L. Selman, eds., Complexity Theory Retrospective II, Springer Verlag, pp:1–22, 1997.

5. D. A. M. Barrington, N. Immerman, and H. Straubing, On Uniformity Within NC 1. Journal of Computer and System Science, 41:274–306, 1990.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the complexity of inducing categorical and quantitative association rules;Theoretical Computer Science;2004-02

2. Arithmetic Circuits and Polynomial Replacement Systems;SIAM Journal on Computing;2004-01

3. Arithmetic Complexity, Kleene Closure, and Formal Power Series;Theory of Computing Systems;2003-06-06

4. Arithmetic Constant-Depth Circuit Complexity Classes;Mathematical Foundations of Computer Science 2003;2003

5. Uniform constant-depth threshold circuits for division and iterated multiplication;Journal of Computer and System Sciences;2002-12