Integer Circuit Evaluation Is PSPACE-Complete

Journal of Computer and System Sciences

Volumn 63, Issue 2, 2001, Pages 288-303

  Yang, Ke ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Chinese remainder theorem; Integer circuit; PSPACE

Indexed keywords

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

References (10)

1. Allender E., Jiao J., Mahajan M., Vinay V. Noncommutative arithmetic circuits: depth reduction and size lower bounds. Theoret. Comput. Sci. 209:1998;47-86.
2. Babai L., Fortnow L. Arithmetization: A new method in structural complexity theory. Comput. Complexity. 1:1991;41-66.
3. Beaudry M., McKenzie P., Péladeau P., Thérien D. Finite monoids: from word to circuit evaluation. SIAM J. Comput. 26:1997;138-152.
4. Hua L. K. Introduction to Number Theory. 1982;Springer-Verlag, Berlin.
5. Cai J., Furst M. L. PSPACE survives three-bit bottlenecks. Proceedings, Structure in Complexity Theory, 2nd Annual Conference, Cornell University, Ithaca, NY, 16-19 June 1987. 1987;IEEE Computer Society Press, Los Alamitos. p. 94-102.
6. Long C. T. Elementary Introduction to Number Theory. 1965;D. C. Heath, Boston.
7. P. McKenzie, H. Vollmer, and, K. W. Wagner, Arithmetic circuits and polynomial replacement systems, in, Proceedings of the 2000 FSTTCS Conference, New Delhi, India, December 2000.
8. Papadimitriou C. H. Computational Complexity. 1994;Addison-Wesley, Reading. p. 455-491.
9. L. J. Stockmeyer, and A. R. Meyer, Word problems requiring exponential time, in Proceedings, The 5th Annual ACM Symposium on Theory of Computing, Austin, Texas, 30 April-2 May 1973, pp. 1-9.
10. Wagner K. W. The Complexity of Problems Concerning graphs with Regularities. Technical report. 1984.