Publication:3666904
From MaRDI portal
zbMath0518.08001MaRDI QIDQ3666904
Jiri Demel, Marie Demlová, Václav Koubek
Publication date: 1982
Full work available at URL: https://eudml.org/doc/17183
algorithm; decision; time complexity; subdirectly irreducible algebra; automaton; simple algebra; finite universal algebra
03D15: Complexity of computation (including implicit computational complexity)
08A30: Subalgebras, congruence relations
08A05: Structure theory of algebraic structures
Related Items
Computational complexity of some problems involving congruences on algebras, Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra, Universal algebras