Tractable Benchmarks For Constraint Programming
The general constraint satisfaction problem for variables with finite domains is known to be NP-complete, but many different conditions have been identified which are sufficient to ensure that classes of instances satisfying those conditions are tractable, that is, solvable in polynomial time. Resul...
| Hauptverfasser: | , |
|---|---|
| Format: | Report |
| Veröffentlicht: |
OUCL
2009
|