On TC0, AC0, and arithmetic circuits

Journal of Computer and System Sciences

Volumn 60, Issue 2, 2000, Pages 395-421

  Agrawal, Manindra ^a   Allender, Eric ^b   Datta, Samir ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; LOGIC GATES; MATHEMATICAL MODELS;

ARITHMETIC CIRCUITS;

LOGIC CIRCUITS;

EID: 0033907710     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1675     Document Type: Article

References (47)

1. Allender E., Ambainis A., Mix Barrington D., Datta S., LêThanh H. Bounded depth arithmetic circuits: Counting and closure. Proc. 26th International Colloquium on Automata, Languages, and Programming (ICALP). 1999;. p. 149-158.
2. Allender E., Hertrampf U. Depth reduction for circuits of unbounded fan-in. Inform. and Comput. 112:1994;217-238.
3. Allender E., Beals R., Ogihara M. The complexity of matrix rank and feasible systems of linear equations. Proc. 28th ACM Symposium on Theory of Computing (STOC). 1996;. p. 161-167.
4. Álvarez C., Jenner B. A very hard log-space counting class. Theoret. Comput. Sci. 107:1993;3-30.
5. Allender E., Jiao J., Mahajan M., Vinay V. Noncommutative arithmetic circuits: depth reduction and size lower bounds. Theoret. Comput. Sci. 209:1998;47-86.
6. Allender E. The permanent requires large uniform threshold circuits. Chicago J. Theoret. Comput. Sci. 7:1999.
7. Allender E. P-uniform circuit complexity. J. Assoc. Comput. Mach. 36:1989;912-928.
8. Allender E. A note on uniform circuit lower bounds for the counting hierarchy. International Conference on Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science. 1090:1996;Springer-Verlag, Berlin. p. 127-135.
9. Allender E., Ogihara M. Relationships among PL, #L, and the determinant. Theoret. Inform. Appl. (RAIRO). 30:1996;1-21.
10. 0 circuits with negative constants, in, Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), 1998.
11. Beame P., Cook S., Hoover H. J. Log depth circuits for division and related problems. SIAM J. Comput. 15:1986;994-1003.
12. Boyar J., Frandsen G., Sturtivant G. An arithmetical model of computation equivalent to threshold circuits. Theoret. Comput. Sci. 93:1992;303-319.
13. 1. J. Comput. System Sci. 41:1990;274-306.
14. 1. J. Assoc. Comput. Mach. 35:1988;941-952.
15. Beigel R., Tarui J. On ACC. Comput. Complexity. 4:1994;350-366.
16. 1 computation. J. Comput. System Sci. 57:1998;200-212.
17. Chandra A., Stockmeyer L., Vishkin U. Constant depth reducibility. SIAM J. Comput. 13:1984;423-439.
18. Denenberg L., Gurevich Y., Shelah S. Definability by constant-depth polynomial-size circuits. Inform. and Control. 70:1986;216-240.
19. Davida G. I., Litow B. Fast parallel arithmetic via modular representation. SIAM J. Comput. 20:1991;756-765.
20. Dietz P. F., Macarie I. I., Seiferas J. I. Bits and relative order from residues, space efficiently. Inform. Process. Lett. 50:1994;123-127.
21. Etessami K. Counting quantifiers, successor relations, and logarithmic space. J. Comput. System Sci. 54:1997;400-411.
22. Fenner S. A., Fortnow L. J., Kurtz S. A. Gap-definable counting classes. J. Comput. System Sci. 48:1994;116-148.
23. Fagin R., Klawe M., Pippenger N., Stockmeyer L. Bounded-depth, polynomial-size circuits for symmetric functions. Theoret. Comput. Sci. 36:1985;239-250.
24. Frandsen G., Valence M., Mix Barrington D. Some results on uniform arithmetic circuit complexity. Math. Systems Theory. 27:1994;105-124.
25. Gill J. Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6:1977;675-695.
26. Hardy G. H., Wright E. M. An Introduction to the Theory of Numbers. 1979;Oxford Press, Oxford.
27. Immerman N., Landau S. The complexity of iterated multiplication. Inform. and Comput. 116:1995;103-116.
28. Litow B. On iterated integer product. Inform. Process. Lett. 42:1992;269-272.
29. Macarie I. Space-efficient deterministic simulation of probabilistic automata. SIAM J. Comput. 27:1998;448-465.
30. Mahajan M., Vinay V. Determinant: Combinatorics, algorithms, and complexity. Chicago J. Theoret. Comput. Sci. 5:1997.
31. F. Noilhan, and, M. Santha, Semantical counting circuits, manuscript, Université Paris-Sud.
32. Parberry I., Schnitger G. Parallel computation with threshold functions. J. Comput. System Sci. 36:1988;278-302.
33. Razborov A. A. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Math. Zametki. 41:1987;598-607.
34. Razborov A. A., Rudich S. Natural proofs. J. Comput. System Sci. 55:1997;24-35.
35. Reif J., Tate S. On threshold circuits and polynomial computation. SIAM J. Comput. 21:1992;896-908.
36. Ruzzo W. On uniform circuit complexity. J. Comput. System. Sci. 21:1981;365-383.
37. Smolensky R. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. Proceedings, 19th ACM Symposium on Theory of Computing. 1987;. p. 77-82.
38. Santha M., Tan S. Verifying the determinant in parallel. Comput. Complexity. 7:1998;128-151.
39. S. Toda, Counting problems computationally equivalent to the determinant, manuscript.
40. Toda S. Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Trans. Inform. and Systems. E75-D:1992;116-124.
41. Valiant L. Completeness classes in algebra. Proc. 11th ACM Symposium on Theory of Computing (STOC). 1979;. p. 249-261.
42. Valiant L. The complexity of computing the Permanent. Theoret. Comput. Sci. 8:1979;189-201.
43. Valiant L. Why is boolean complexity theory difficult? Paterson M. S. Boolean Function Complexity. London Mathematical Society Lecture Notes Series. 169:1992;84-94 Cambridge University Press, Cambridge.
44. Venkateswaran H. Circuit definitions of nondeterministic complexity classes. SIAM J. Comput. 21:1992;655-670.
45. Vinay V. Counting auxiliary pushdown automata and semi unbounded arithmetic circuits. Proc. 6th IEEE Structure in Complexity Theory Conference. 1991;. p. 270-284.
46. Wagner K. W. The complexity of combinatorial problems with succinct input representation. Acta Inform. 23:1986;325-356.
47. 0 counting circuits, manuscript, 1996.