On Minimal Constraint Networks
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter conjectured this computation problem to be NP-hard. We prove thi...
| Hlavní autor: | |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
2011
|