scientific article; zbMATH DE number 3763999

MaRDI QIDQ3946212zbMATHFDO

Authors Jiri Demel

Publication date 1982

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

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)

Cites work

• scientific article; zbMATH DE number 3757710 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3248552 (Why is no real title available?)
• scientific article; zbMATH DE number 3290336 (Why is no real title available?)
• Efficiency of a Good But Not Linear Set Union Algorithm
• Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
• Subdirect unions in universal algebra

Cited in

(4)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3946212)