Arithmetic circuits and polynomial replacement systems

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

Volumn 1974, Issue , 2000, Pages 164-175

  McKenzie, Pierre ^a   Vollmer, Heribert ^b   Wagner, Klaus W ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING; TIMING CIRCUITS;

ARITHMETIC CIRCUIT; NATURAL NUMBER; P-COMPLETE; PROOF TREE; REPLACEMENT SYSTEMS; STRAIGHT LINE PROGRAM;

ELECTRIC NETWORK ANALYSIS;

EID: 84947783454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_13     Document Type: Conference Paper

References (18)

1. E. Allender, A. Ambainis, D. Mix Barrington, S. Datta, and H. LêThanh. Bounded depth arithmetic circuits: Counting and closure. In Proceedings 26th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Berlin Heidelberg, 1999. Springer Verlag. To appear.
2. M. Agrawal, E. Allender, and S. Datta. On TC0, AC0, and arithmetic circuits. In Proceedings 12th Computational Complexity, pages 134–148. IEEE Computer Society, 1997.
3. E. Allender. Making computation count: arithmetic circuits in the nineties. SIGACT News, 28(4):2–15, 1998.
4. L. Babai and L. Fortnow. Arithmetization: a new method in structural complexity theory. Computational Complexity, 1:41–66, 1991.
5. H. Caussinus, P. McKenzie, D. Thérien, and H. Vollmer. Nondeterministic NC1 computation. Journal of Computer and System Sciences, 57:200–212, 1998.
6. O. Ibarra and S. Moran. Probabilistic algorithms for deciding equivalence of straight-line programs. Journal of the ACM, 30:217–228, 1983.
7. E. Kaltofen. Greatest common divisors of polynomials given by straightline programs. Journal of the ACM, 35:231–264, 1988.
8. Y. V. Matiasjevič. Hilbert’s Tenth Problem. Foundations of Computing Series. MIT Press, Cambridge, MA, 1993.
9. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time. In Proceedings 5th ACM Symposium on the Theory of Computing, pages 1–9. ACM Press, 1973.
10. I. H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery, 25:405–414, 1978.
11. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8(3):411–421, 1979.
12. H. Venkateswaran. Circuit definitions of non-deterministic complexity classes. SIAM Journal on Computing, 21:655–670, 1992.
13. V. Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proceedings 6th Structure in Complexity Theory, pages 270–284. IEEE Computer Society Press, 1991.
14. L. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. Fast parallel computation of polynomials using few processors. SIAM Journal on Computing, 12:641–644, 1983.
15. H. Venkateswaran and M. Tompa. A new pebble game that characterizes parallel complexity classes. SIAM J. on Computing, 18:533–549, 1989.
16. K. W. Wagner. The complexity of problems concerning graphs with regularities. Technical report, Friedrich-Schiller-Universität Jena, 1984. Extended abstract in Proceedings 11th Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 176, pages 544–552, 1984.
17. K. W. Wagner. The complexity of combinatorial problems with succinct input representation. Acta Informatica, 23:325–356, 1986.
18. K. Yang. Integer circuit evaluation is PSPACE-complete. In Proceedings 15th Computational Complexity Conference, pages 204–211. IEEE Computer Society Press, 2000.