MONOIDS AND COMPUTATIONS
From MaRDI portal
Cites work
- \(NC^ 1\): The automata-theoretic viewpoint
- A Uniform Circuit Lower Bound for the Permanent
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
- An Application of Hindman's Theorem to a Problem on Communication Complexity
- An ergodic theorem for read-once non-uniform deterministic finite automata
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Categories as algebra: An essential ingredient in the theory of monoids
- Finite monoids and the fine structure of NC 1
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- Locally trivial categories and unambiguous concatenation
- Non-uniform automata over groups
- On the expressive power of temporal logic
- Sur le produit de concatenation non ambigu
- The kernel of monoid morphisms
- Two-sided wreath product of categories
Cited in
(13)- Special monoids and special Thue systems
- How to shell a monoid
- Symbolic computation with monotone operators
- Equivalence and equation solvability problems for the alternating group A₄.
- Evaluation of polynomials over finite rings via additive combinatorics
- Monoids and decay
- Weakly iterated block products and applications to logic and complexity
- An Algebraic Perspective on Boolean Function Learning
- Finite Monoids: From Word to Circuit Evaluation
- scientific article; zbMATH DE number 1419259 (Why is no real title available?)
- scientific article; zbMATH DE number 7444014 (Why is no real title available?)
- The Monoids of Order Eight and Nine
- An assertion concerning functionally complete algebras and NP-completeness
This page was built for publication: MONOIDS AND COMPUTATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658713)
