scientific article

zbMath0486.08003MaRDI QIDQ3946212

Jiri Demel

Publication date: 1982

Full work available at URL: https://eudml.org/doc/27611

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmstime complexitysubdirectly irreducible algebrassubdirect productmaximal congruencesubdirect reduction of finite algebras

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 (4)

Computers and universal algebra: Some directions ⋮ Effective subdirect decomposition: A case study ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra

Cites Work

• Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
• Efficiency of a Good But Not Linear Set Union Algorithm
• Subdirect unions in universal algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: