Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields
From MaRDI portal
Publication:2491185
Cited in
(20)- Undecidable problems for completely 0-simple semigroups.
- Equivalence and equation solvability problems for the alternating group A₄.
- Evaluation of polynomials over finite rings via additive combinatorics
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
- Monoids with sub-log-exponential free spectra.
- Improved lower bounds for the complexity of finite semigroups
- Complexity issues of checking identities in finite monoids
- On the rank of the Rees-Sushkevich varieties.
- THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
- Identity checking problem for transformation monoids
- ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM
- Identities of the Kauffman Monoid $$\mathcal {K}_4$$ and of the Jones Monoid $$\mathcal {J}_4$$
- Identities of the Kauffman monoid \(\mathcal{K}_3\)
- A survey on varieties generated by small semigroups and a companion website
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- Hardness of equations over finite solvable groups under the exponential time hypothesis
- Flexible constraint satisfiability and a problem in semigroup theory
- Complexity of the identity checking problem for finite semigroups.
- Word problem of the Perkins semigroup via directed acyclic graphs.
- An assertion concerning functionally complete algebras and NP-completeness
This page was built for publication: Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491185)
