Equivalence problems for circuits over sets of natural numbers

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

Volumn 4649 LNCS, Issue , 2007, Pages 127-138

  Glaßer, Christian ^a   Herr, Katrin ^a   Reitwießner, Christian ^a   Travers, Stephen ^a   Waldherr, Matthias ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; NETWORKS (CIRCUITS); SET THEORY;

EQUIVALENCE PROBLEMS; MEMBERSHIP PROBLEMS; NATURAL NUMBERS; SYSTEMATIC CHARACTERIZATION;

PROBLEM SOLVING;

EID: 37249076935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74510-5_15     Document Type: Conference Paper

References (12)

1. Allender, E.: Making computation count: Arithmetic circuits in the nineties. SIGACT NEWS 28(4), 2-15 (1997)
2. Breunig, H.: The complexity of membership problems for circuits over sets of positive numbers. In: Proceedings 16th International Symposium on Fundamentals of Computation Theory. LNCS, Springer, Heidelberg 2007 (to appear)
3. Ko, K.: Some observations on the probabilistic algorithms and NP-hard problems. Information Processing Letters 14(1), 39-43 (1982)
4. Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential time. In: Proceedings 13th Symposium on Switching and Automata Theory, pp. 125-129. IEEE Computer Society Press, Los Alamitos (1972)
5. McKenzie, P., Wagner, K.W.: The complexity of membership problems for circuits over sets of natural numbers. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 571-582. Springer, Heidelberg (2003)
6. Schönhage, A.: On the power of random access machines. In: ICALP, pp. 520-529 (1979)
7. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proceedings 5th ACM Symposium on the Theory of Computing, pp. 1-9. ACM Press, New York (1973)
8. Sudborough, I.H.: On the tape complexity of deterministic context-free languages. Journal of the ACM 25(3), 405-414 (1978)
9. Travers, S.: The complexity of membership problems for circuits over sets of integers. Theoretical Computer Science 369(1), 211-229 (2006)
10. Wagner, K.: The complexity of problems concerning graphs with regularities. In: Proceedings Mathematical Foundations of Computer Science. LNCS, vol. 176, pp. 544-552. Springer, Heidelberg (1984)
11. Wagner, K.W., Wechsung, G.: On the boolean closure of NP. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 485-493. Springer, Heidelberg (1985)
12. Yang, K.: Integer circuit evaluation is PSPACE-complete. In: IEEE Conference on Computational Complexity, pp. 204-213. IEEE Computer Society Press, Los Alamitos (2000)