Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra

DOI10.1016/0304-3975(85)90042-8zbMath0568.08002MaRDI QIDQ1060232

Václav Koubek, Marie Demlová, Jiri Demel

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90042-8

zbMATH Keywords

algorithms; ideals; subalgebras; finite algebra; simple; subdirectly irreducible; minimal nontrivial congruences

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

08A30: Subalgebras, congruence relations

08-04: Software, source code, etc. for problems pertaining to general algebraic systems

Related Items

Congruence lattices of algebras— the signed labelling, Computational complexity of some problems involving congruences on algebras, An algebraic theory of functional and multivalued dependencies in relational databases, Effective subdirect decomposition: A case study, On the disjunctive set problem, COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES, Unnamed Item, Unnamed Item

Cites Work

• Group-theoretic algorithms and graph isomorphism
• On the computational power of pushdown automata
• Depth-First Search and Linear Graph Algorithms
• Subdirect unions in universal algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item