A Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSP
Main Authors: | Cooper, M, Escamoche, G, Živný, S |
---|---|
Format: | Conference item |
Published: |
Springer
2012
|
Similar Items
-
Variable elimination in binary CSP via forbidden patterns
by: Cohen, D, et al.
Published: (2013) -
Supermodular Functions and the Complexity of MAX CSP
by: Cohen, D, et al.
Published: (2004) -
Supermodular functions and the complexity of MAX CSP
by: Cohen, D, et al.
Published: (2005) -
Identifying efficiently solvable cases of Max CSP
by: Cohen, D, et al.
Published: (2004) -
Composable inference metaprogramming using subproblems
by: Handa, Shivam.
Published: (2019)