scientific article; zbMATH DE number 3880117

MaRDI QIDQ3345784zbMATH OpenFDO

Authors Helmut Jürgensen

Publication date 1983

zbMATH Keywords

algorithmclosure operationscomplexity of generating subalgebrasrandom access machineuniversal algebra

Mathematics Subject Classification ID

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

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

Cited in

(7)

• scientific article; zbMATH DE number 3847210 (Why is no real title available?)
• scientific article; zbMATH DE number 3880845 (Why is no real title available?)
• Algebraic progressions and generation of subsets in universal algebra
• scientific article; zbMATH DE number 3914389 (Why is no real title available?)
• scientific article; zbMATH DE number 3002458 (Why is no real title available?)
• COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA
• Constructive universal algebra: An introduction

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)