Circuits with monoidal gates

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

Volumn 665 LNCS, Issue , 1993, Pages 555-565

  Beaudry, Martin ^a   McKenzie, Pierre ^b   Péladeau, Pierre ^c  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TIMING CIRCUITS;

ALGEBRAIC PROPERTIES; CIRCUIT EVALUATION; COUNTING CLASS; CYCLIC GROUP; FINITE MONOID; NATURAL EXTENSION; P-COMPLETE; WORD PROBLEM;

ALGEBRA;

EID: 0343298004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56503-5_55     Document Type: Conference Paper

References (25)

1. C. ALVAREZ and B. Jenner, A very hard log space counting class, Proc. of the 5th IEEE Structure in Complexity Theory Conference (1990), pp. 154-168.
2. D.A. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, J. Computer and Systems Science 38 (1989), pp. 150-164.
3. D.A.M. Barrington, N. Immerman and H. Straubing, On uniformity within NC1, J. Computer and Systems Science 41 (1990), pp. 274-306.
4. D.A. Barrington, H. Straubing and D. Thérien, Non-Uniform Automata Over Groups, Information and Computation 89, 2 (1990), pp. 109-132.
5. D.A. Barrington and D. Thérien, Finite Monoids and the Fine Structure of NC1, J. of the Association for Computing Machinery 35 (1988), pp. 941-952.
6. M. Beaudry and P. McKenzie, Circuits, matrices, and nonassociative computation, Proc. of the 7th IEEE Structure in Complexity Theory Conference (1992), pp. 94-106.
7. R. BEIGEL, J. Gill and U. Hertrampf, Counting classes: thresholds, parity, mods, and fewness, Proc. of the 7th Symp. on Theoretical Aspects of Computer Science, Springer Lecture Notes in Comp. Sci. 415 (1990), pp. 49-57.
8. F. Bédard, F. Lemieux and P. McKenzie, Extensions to Barrington’s M-program model, Proc. of the 5th IEEE Structure in Complexity Theory Conference (1990), pp. 200-210. Extended version to appear in Theoretical Computer Science.
9. G. Bergman, Embedding arbitrary algebras into groups, Algebra Universalis 25 (1988), pp. 107-120.
10. G. Buntrock, C. Damm, U. Hertrampf and C. Meinel, Structure and importance of Logspace-MOD-classes Math. Syst. Theory 25 (1992), pp. 223-237.
11. S.R. Buss, S. Cook, A. Gupta and V. Ramachandran, An optimal parallel algorithm for formula evaluation, (1989), to appear in SIAM I. on Computing.
12. S.A. COOK, A taxonomy of problems with fast parallel solutions, Information and Computation 64 (1985), pp. 2-22.
13. S.A. Cook and P. McKenzie, Problems Complete for Deterministic Logarithmic Space, J. of Algorithms 8 (1987), pp. 385-394.
14. S. Eilenberg, Automata, Languages and Machines, Vol. B, Academic Press (1976).
15. N. Immerman, Nondeterministic space is closed under complementation, SIAM J. on Computing 17, 5 (1988), pp. 935-938.
16. N. Immerman and S. Landau, The complexity of iterated multiplication, Proc. of the 3rd Structure in Complexity Conference (1989), IEEE Computer Society Press, pp. 104-111.
17. R.E. Ladner, The circuit value problem is log-space complete for P, ACM SIGACT Newsletter 7 (1975), pp. 18-20.
18. P. McKenzie, P. Péladeau and D. Thérien, NC1: the automata-theoretic viewpoint, Computational Complexity 1 (1991), 330-359.
19. J.-E. PIN, Variétés de langages formels, Masson (1984). Varieties of Formal Langages, Plenum Press (1986).
20. W. RUZZO, On uniform circuit complexity, J. Computer and Systems Science 22 (1981), pp. 365-383.
21. W. RUZZO, J. Simon and M. Tompa, Space-bounded hierarchies and probabilistic computations J. Computer and Systems Science 28 (1984), pp. 216-230.
22. H. STRAUBING Varieties of recognizable sets whose syntactic monoids contain solvable groups, Ph. D. Thesis, UC Berkely, 1978.
23. H. STRAUBING The variety generated by finite nilpotent monoids, Semigroup Forum 24 (1982), pp. 25-38.
24. R. Szelepcsényi, The method of forcing for nondeterministic automata, Bull. Europ. Assoc. Theor. Comp. Sci. 33 (1987), pp. 96-100.
25. D. Thérien, Classification of finite monoids: the language approach, Theoretical Computer Science 14 (1981), pp. 195-208.