48 citations · 232 across the 19 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012★ 48 cited
An Algebraic Theory of Complexity for Discrete Optimisation
David A. Cohen, Martin C. Cooper, Paidi Creed +2
Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a su…
cs.AI2012
A Dichotomy for 2-Constraint Forbidden CSP Patterns
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…