The complexity of membership 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 2607, Issue , 2003, Pages 571-582

  McKenzie, Pierre ^a   Wagner, Klaus W ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

AUXILIARY PROBLEM; COMPLEXITY CLASS; MEMBERSHIP PROBLEM; NATURAL NUMBER; NP COMPLETE; PSPACE-COMPLETE;

COMPUTATIONAL COMPLEXITY;

EID: 35248880201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_50     Document Type: Article

References (22)

1. 0, and arithmetic circuits, J. Computer and System Sciences 60 (2000), pp. 395-421.
2. E. Allender, Making computation count: Arithmetic circuits in the Nineties, in the Complexity Theory Column, SIGACT NEWS 28 (4) (1997) pp. 2-15.
3. E. Allender, K. Reinhardt, S. Zhou, Isolation, matching, and counting: Uniform and nonuniform upper bounds, J. Computer and System Sciences 59(1999), pp. 164-181.
4. E. Allender, D. Barrington, and W. Hesse, Uniform constant-depth threshold circuits for division and iterated multiplication, Proceedings 16th Conference on Computational Complexity, 2001, pp. 150-159.
5. E. Allender, J. Jiao, M. Mahajan and V. Vinay, Non-commutative arithmetic circuits: depth-reduction and depth lower bounds, Theoretical Computer Science Vol. 209 (1,2) (1998), pp. 47-86.
6. E. Bach, J. Shallit, Algorithmic Number Theory, Volume I: Efficient Algorithms, MIT Press 1996.
7. M. Beaudry and P. McKenzie, Circuits, matrices and nonassociative computation, J. Computer and System Sciences 50 (1995), pp. 441-455.
8. M. Beaudry, P. McKenzie, P. Peladeau, D. Thérien, Finite monoids: from word to circuit evaluation, SIAM J. Computing 26 (1997), pp. 138-152.
9. S. Buss, S. Cook, A. Gupta, V. Ramachandran, An optimal parallel algorithm for formula evaluation, SIAM J. Computing 21 (1992), pp. 755-780.
10. S. R. Buss, The boolean formula value problemis in ALOGTIME, Proceedings 19th ACM Symp, on the Theory of Computing, 1987, pp. 123-131.
11. 1 computation, J. Computer and System Sciences, 57 (2), 1998, pp. 200-212.
12. A. K. Chandra, L. Stockmeyer, U. Vishkin, Constant depth reducibility, SIAM Journal on Computing, 13, 1984, pp. 423-439.
13. 1 division, available at http://www.cs.jcu.edu.au/ bruce/papers/cr00_3.ps.gz
14. L. M. Goldschlager, The monotone and planar circuit value problems are logspace complete for P, SIGACT News, 9, 1977, pp. 25-29.
15. 0, Proceedings of the 28th International Colloquium on Automata, Languages, and Programming 2001, Lecture Notes in Computer Science 2076, pp. 104-114
16. J. von zur Gathen, Parallel algorithms for algebraic problems, SIAM J. on Computing 13(4), (1984), pp. 802-824.
17. R. Greenlaw, J. Hoover and L. Ruzzo, Limits to parallel computation, P-completeness theory, Oxford University Press, 1995, 311 pages.
18. M. Ogihara, The PL hierarchy collapses, SIAM Journal of Computing, 27, 1998, pp. 1430-1437.
19. L. J. Stockmeyer, A. R. Meyer, Word Problems Requiring Exponential Time, Proceedings 5th ACM Symposium on the Theory of Computing, 1973, pp. 1-9.
20. H. Vollmer, Circuit complexity, Springer, 2000.
21. K. W. Wagner, The complexity of problems concerning graphs with regularities, Proceedings 11th Mathematical Foundations of Computer Science 1984, Lecture Notes in Computer Science 176, pp. 544-552. Full version as TR N/84/52, Friedrich-Schiller-Universität Jena, 1984.
22. K. Yang, Integer circuit evaluation is PSPACE-complete, Proceedings 15th Conference on Computational Complexity, 2000, pp. 204-211.