The following pages link to (Q4737176):
Displaying 8 items.
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (Q2570127) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- STACS 2004 (Q5309710) (← links)