On counting AC0 circuits with negative constants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 409-417

  Ambainis, Andris ^a   Barrington, David Mix ^b   LêThanh, Huong ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARITHMETIC CIRCUIT; LOG SPACE; NEGATIVE CONSTANTS;

TIMING CIRCUITS; LOGIC CIRCUITS;

EID: 84896747814     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055790     Document Type: Conference Paper

References (19)

1. 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. Alvarez, 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. 1. Journal of Computer and System Science, 41:274-306, 1990.
6. P. Beame, S. Cook, H. J. Hoover, Log depth circuits for division and related problems. SIAM Journal on Computing, 15:994-1003, 1986.
7. 1. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pp:12-21, 1996.
8. S. A. Fenner, L. J. Fortnow, S. A. Kurtz, Gap-definable counting classes. Journal of Computer and System Science, 48(1):116-148, 1995.
9. J. Köbler, U. Schöning, J. Torán, On counting and approximation. Acta Informatica, 26:363-379, 1989.
10. B. Litow, On iterated integer product. Information Processing Letters, 42(5):269-272, 1992.
11. M. Mahajan, V. Vinay, Determinant: Combinatorics, Algorithms and Complexity. In Proceedings of SODA'97. ftp://ftp.eccc.uni-trier.de/pub/eccc/ reports/1997/TR97-036/index.html
12. A. A. Razborov, Lower bound on size of bounded depth networks over a complete basis with logical addition. Mathematicheskie Zametli, 41:598-607, 1987
13. English translation in Mathematical Notes of the Academy of Sciences of the USSR, 41:333-338, 1987.
14. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the 19th ACM Symposium on the Theory of Computing (STOC), pp:77-82, 1987.
15. S. Toda, Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions, Informations and Systems, E75-D:116-124, 1992.
16. S. Toda, Counting problems computationally equivalent to the determinant. Manuscript.
17. L. Valiant, The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
18. H. Venkateswaran, Circuit definitions of non-deterministic complexity classes. SIAM Journal on Computing, 21:655-670, 1992.
19. V. Vinay, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proceedings of the 6th IEEE Structure in Complexity Theory Conference, pp:270-284, 1991.