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

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

Václav Koubek, Jiri Demel, Marie Demlová

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

algorithmsidealssubalgebrasfinite algebrasimplesubdirectly irreducibleminimal nontrivial congruences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Subalgebras, congruence relations (08A30) Software, source code, etc. for problems pertaining to general algebraic systems (08-04)

Related Items (9)

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

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

This page was built for publication: Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra