The following pages link to STACS 2005 (Q5710685):
Displaying 13 items.
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
- Maximal infinite-valued constraint languages (Q1014639) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- Polynomial constraints and unsat cores in \textsc{Tarski} (Q1662298) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- Complexity and approximability of quantified and stochastic constraint satisfaction problems (Q2741527) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311100) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900292) (← links)