The complexity of membership problems for circuits over sets of integers

Theoretical Computer Science

Volumn 369, Issue 1-3, 2006, Pages 211-229

  Travers, Stephen ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Arithmetic circuits; Combinational circuits; Completeness; Computational complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; INTEGER PROGRAMMING; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

ARITHMETIC CIRCUITS; COMPLETENESS; INTEGERS; NATURAL NUMBERS;

COMBINATORIAL CIRCUITS;

EID: 33751013022     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.08.017     Document Type: Article

References (14)

1. Allender E. Making computation count: arithmetic circuits in the nineties in the complexity theory column. SIGACT NEWS 28 4 (1997) 2-15
2. J.L. Balcázar, A. Lozano, J. Torán, The complexity of algorithmic problems in succinct instances, Computer Science, Plenum Press, New York, 1992.
3. Crandall R.E., Mayer E.W., and Papadopoulos J.S. The twenty-fourth fermat number is composite. Math. Comput. 72 (2003) 1555-1572
4. Goldschlager L.M. The monotone and planar circuit value problems are logspace complete for P. SIGACT NEWS 9 (1977) 25-29
5. Hardy G.H., and Wright E.M. An Introduction to the Theory of Numbers (1979), Oxford University Press, Oxford
6. Immerman N. Nondeterministic space is closed under complementation. SIAM J. Comput. 17 (1988) 935-938
7. P. McKenzie, K.W. Wagner, The complexity of membership problems for circuits over sets of natural numbers, Lecture Notes in Computer Science, Vol. 2607, 2003, pp. 571-582.
8. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley, Reading, MA
9. H. Petersen, Bemerkungen zu ganzzahligen Ausdrücken, private communication, 2004.
10. Savitch W.J. Maze recognizing automata and nondeterministic tape complexity. J. Comput. System Sci. 7 (1973) 389-403
11. L.J. Stockmeyer, A.R. Meyer, Word problems requiring exponential time, in: Proc. Fifth ACM Symp. on the Theory of Computing, 1973, pp. 1-9.
12. Szelepcsényi R. The method of forced enumeration for nondeterministic automata. Artificial Intelligence 26 (1984) 279-284
13. K.W. Wagner, The complexity of problems concerning graphs with regularities, in: Proc. 11th Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 176, 1984, pp. 544-552.
14. K. Yang, Integer circuit evaluation is PSPACE-complete, in: Proc. 15th Conference on Computational Complexity, 2002, pp. 204-211.