The following pages link to FINDING TYPE SETS IS NP-HARD (Q4024641):
Displayed 5 items.
- An approach to tame congruence theory via subtraces (Q1312169) (← links)
- On the complexity of the Leibniz hierarchy (Q1740630) (← links)
- Computers and universal algebra: Some directions (Q1902542) (← links)
- ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS (Q3621430) (← links)
- THE TYPE SET OF A VARIETY IS NOT COMPUTABLE (Q4786272) (← links)