scientific article; zbMATH DE number 3763999

zbMATH Open0486.08003MaRDI QIDQ3946212FDOQ3946212

Authors: Jiri Demel 

Publication date: 1982

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

Title of this publication is not available (Why is that?)

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

• Title not available (Why is that?)
• Efficiency of a Good But Not Linear Set Union Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subdirect unions in universal algebra
• Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
• Title not available (Why is that?)

Cited In (4)

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

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)