Pages that link to "Item:Q840700"
From MaRDI portal
The following pages link to The complexity of constraint satisfaction games and QCSP (Q840700):
Displaying 6 items.
- Complexity of the game domination problem (Q313955) (← links)
- The complexity of equivalence, entailment, and minimization in existential positive logic (Q473196) (← links)
- Boolean max-co-clones (Q494629) (← links)
- The complexity of counting quantifiers on equality languages (Q515549) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) (← links)
