Pages that link to "Item:Q1313952"
From MaRDI portal
The following pages link to Fast parallel constraint satisfaction (Q1313952):
Displaying 11 items.
- Constraints, consistency and closure (Q1274280) (← links)
- Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (Q1274552) (← links)
- On the algebraic structure of combinatorial problems (Q1276253) (← links)
- Characterising tractable constraints (Q1321064) (← links)
- Local and global relational consistency (Q1391940) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects (Q2273354) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Uncovering trees in constraint networks (Q2676569) (← links)
- An algebraic characterization of tractable constraints (Q6085763) (← links)
