Computing congruences efficiently

DOI10.1007/s00012-008-2073-1zbMath1158.08001OpenAlexW2045417459MaRDI QIDQ1001460

Ralph Freese

Publication date: 17 February 2009

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-008-2073-1

zbMATH Keywords

data structureprincipal congruencefind-union problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Subalgebras, congruence relations (08A30)

Related Items (6)

Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC ⋮ Unnamed Item ⋮ The complexity of computing all subfields of an algebraic number field ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS ⋮ Polynomial-time tests for difference terms in idempotent varieties

This page was built for publication: Computing congruences efficiently