FINDING TYPE SETS IS NP-HARD

DOI10.1142/S0218196791000304zbMath0757.08005OpenAlexW2056825649MaRDI QIDQ4024641

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)

Related Items (5)

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

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