FINDING TYPE SETS IS NP-HARD

DOI10.1142/S0218196791000304zbMATH Open0757.08005OpenAlexW2056825649MaRDI QIDQ4024641FDOQ4024641

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

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
• COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS

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)

Cited In (5)

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

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)