Decomposition method (constraint satisfaction): Difference between revisions

Content deleted Content added
Hinge decomposition: Fix more occurrences of "an hinge" to "a hinge".
No edit summary
Line 1:
{{More citations needed}}
 
In [[constraint satisfaction]], a '''decomposition method''' translates a [[constraint satisfaction problem]] into another constraint satisfaction problem that is binary and [[directed acyclic graph|acyclic]]. Decomposition methods work by grouping variables into sets, and solving a subproblem for each set. These translations are done because solving binary acyclic problems is a [[tractable problem]].