Pages that link to "Item:Q840700"

The following pages link to The complexity of constraint satisfaction games and QCSP (Q840700):

Displaying 18 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)
• Low-level dichotomy for quantified constraint satisfaction problems (Q1944186) (← links)
• Quantified conjunctive queries on partially ordered sets (Q2634671) (← links)
• Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
• On the Complexity of the Model Checking Problem (Q3176188) (← links)
• Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
• The lattice and semigroup structure of multipermutations (Q5063206) (← links)
• The Complexity of Quantified Constraints Using the Algebraic Formulation (Q5111241) (← links)
• Tractability of quantified temporal constraints to the max (Q5175605) (← links)
• Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
• Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) (← links)
• The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation (Q5875947) (← links)
• Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
• Surjective polymorphisms of directed reflexive cycles (Q6183437) (← links)