A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP

Martin C. Cooper, Guillaume Escamocher, Stanislav Zivny. A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. In Michela Milano, editor, Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Qu├ębec City, QC, Canada, October 8-12, 2012. Proceedings. Volume 7514 of Lecture Notes in Computer Science, pages 265-273, Springer, 2012. [doi]

Abstract

Abstract is missing.