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

Martin C. Cooper Guillaume Escamocher Stanislav Zivný

Published in: CP (2012)

Keyphrases

max csp
constraint satisfaction
computational complexity
arc consistency
artificial intelligence
search space
np hard
constraint networks