FINDING TYPE SETS IS NP-HARD

DOI10.1142/S0218196791000304MaRDI QIDQ4024641zbMATH OpenOpenAlexFDO

Authors David Hobby

Publication date 8 February 1993

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196791000304

zbMATH Keywords

type set\(P\)- Space-complete\(P\)-Space-hardcomposition of a set of unary functionsvariety generated by a finite algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Varieties (08B99)

Recommendations

• THE TYPE SET OF A VARIETY IS NOT COMPUTABLE
• scientific article; zbMATH DE number 1304317
• The set of types of a finitely generated variety
• scientific article; zbMATH DE number 3872682
• COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS

Cited in

(5)

• An approach to tame congruence theory via subtraces
• On the complexity of the Leibniz hierarchy
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• THE TYPE SET OF A VARIETY IS NOT COMPUTABLE
• Computers and universal algebra: Some directions

This page was built for publication: FINDING TYPE SETS IS NP-HARD

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