The equation solvability problem over supernilpotent algebras with Mal’cev term
DOI10.1142/S0218196718500443zbMath1454.08001OpenAlexW2808961372MaRDI QIDQ4687481
Publication date: 12 October 2018
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196718500443
Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Operations and polynomials in algebraic structures, primal algebras (08A40) Congruence modularity, congruence distributivity (08B10) Word problems (aspects of algebraic structures) (08A50)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Some applications of higher commutators in Mal'cev algebras
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- The complexity of the equation solvability problem over nilpotent groups
- The complexity of solving equations over finite groups
- Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
- The equivalence problem for finite rings
- On finite Taylor algebras
- The complexity of the equation solvability problem over semipattern groups
- THE EQUIVALENCE PROBLEM OVER FINITE RINGS
- THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS
- THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
- The complexity of the equivalence problem for nonsolvable groups
This page was built for publication: The equation solvability problem over supernilpotent algebras with Mal’cev term