Effective subdirect decomposition: A case study

DOI10.1016/0304-3975(92)90366-NzbMath0757.08003MaRDI QIDQ1193629

Daniel Benninger, Juerg Schmid

Publication date: 27 September 1992

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

zbMATH Keywords

algorithmssubdirect decompositionpseudocomplemented semilatticepseudocomplemented lattice

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Pseudocomplemented lattices (06D15) Subdirect products and subdirect irreducibility (08B26)

Related Items

Computers and universal algebra: Some directions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
• Subdirectly irreducible p-algebras
• Pseudo-complements in semi-lattices
• Subdirect unions in universal algebra
• Subdirectly irreducible distributive double p-algebras