Pages that link to "Item:Q539977"

The following pages link to Quantified constraint satisfaction and the polynomially generated powers property (Q539977):

Displaying 9 items.

• Polynomial constraints and unsat cores in \textsc{Tarski} (Q1662298) (← links)
• The size of generating sets of powers (Q2318479) (← links)
• Polynomial threshold reoptimization of generalized satisfiability problems with bounded arity predicates (Q2850118) (← links)
• Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
• The Complexity of Quantified Constraints Using the Algebraic Formulation (Q5111241) (← links)
• Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) (← links)
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
• The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation (Q5875947) (← links)
• Principles and Practice of Constraint Programming – CP 2004 (Q5900292) (← links)