Pages that link to "Item:Q3525565"
From MaRDI portal
The following pages link to Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (Q3525565):
Displaying 4 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Characterizations of several Maltsev conditions. (Q2351504) (← links)
