scientific article
From MaRDI portal
Publication:3666904
zbMath0518.08001MaRDI QIDQ3666904
Jiri Demel, Marie Demlová, Václav Koubek
Publication date: 1982
Full work available at URL: https://eudml.org/doc/17183
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmdecisiontime complexitysubdirectly irreducible algebraautomatonsimple algebrafinite universal algebra
Complexity of computation (including implicit computational complexity) (03D15) Subalgebras, congruence relations (08A30) Structure theory of algebraic structures (08A05)
Related Items (3)
Universal algebras ⋮ Computational complexity of some problems involving congruences on algebras ⋮ Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
This page was built for publication: