48 citations · 232 across the 19 of their papers we have counts for
1 paper · 2 filters
Martin C. Cooper, Guillaume Escamocher
Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of…