Decomposition Method (constraint Satisfaction)
In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and 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.
Each structural restriction defined a measure of complexity of solving the problem after conversion; this measure is called width. Fixing a maximal allowed width is a way for identifying a subclass of constraint satisfaction problems. Solving problems in this class is polynomial for most decompositions; if this holds for a decomposition, the class of fixed-width problems form a tractable subclass of constraint satisfaction problems.
Read more about Decomposition Method (constraint Satisfaction): Overview, Decomposition Methods, Decomposition Methods For Binary Problems, Decomposition Methods For Arbitrary Problems, Comparison, Solving From A Decomposition, Structural Restrictions, Online Resources
Famous quotes containing the word method:
“Frankly, I adore your catchy slogan, “Adoption, not Abortion,” although no one has been able to figure out, even with expert counseling, how to use adoption as a method of birth control, or at what time of the month it is most effective.”
—Barbara Ehrenreich (b. 1941)