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...
| 主要な著者: | , |
|---|---|
| フォーマット: | Report |
| 出版事項: |
OUCL
2009
|