Author:
Allender Eric,Datta Samir,Ambainis Andris,Mix Barrington David A.,LêThanh Huong
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. E. Allender, Making computation count: Arithmetic circuits in the nineties. In the Complexity Theory Column, edited by Lane Hemaspaandra, SIGACT NEWS 28, 4:2–15, December 1997.
2. M. Agrawal, E. Allender, S. Datta, On TC°; AC° and arithmetic circuits. In Proceedings of the 12th Annual IEEE Conference on Computational Complexity, pp:134–148, 1997.
3. A. Ambainis, D.M. Barrington, H. LêThanh, On counting AC° circuits with negative constants. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), 1998.
4. J. Aspnes, R. Beigel, M. Furst, S. Rudich, The expressive power of voting polynomials. In Proceedings of the 23th ACM Symposium on Theory of Computing (STOC), pp:402–409, 1991.
5. C. Álvarez, B. Jenner, A very hard logspace counting class. Theoretical Computer Science, 107:3–30, 1993.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献