scientific article; zbMATH DE number 3880117

zbMATH Open0552.68049MaRDI QIDQ3345784FDOQ3345784

Helmut Jürgensen

Publication date: 1983

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

Recommendations

• COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA
• Constructive universal algebra: An introduction
• Computers and universal algebra: Some directions
• scientific article; zbMATH DE number 1236694
• Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra

zbMATH Keywords

algorithmuniversal algebraclosure operationsrandom access machinecomplexity of generating subalgebras

Mathematics Subject Classification ID

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

Cited In (6)

• Constructive universal algebra: An introduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN 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 Q3345784)