
Steepest ascent can be exponential in bounded treewidth problems
We investigate the complexity of local search based on steepest ascent. ...
read it

Representing fitness landscapes by valued constraints to understand the complexity of local search
Local search is widely used to solve combinatorial optimisation problems...
read it

On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns
Singleton arc consistency is an important type of local consistency whic...
read it

Variable and value elimination in binary constraint satisfaction via forbidden patterns
Variable or value elimination in a constraint satisfaction problem (CSP)...
read it

Tractable Combinations of Global Constraints
We study the complexity of constraint satisfaction problems involving gl...
read it

The tractability of CSP classes defined by forbidden patterns
The constraint satisfaction problem (CSP) is a general problem central t...
read it

The Expressive Power of Binary Submodular Functions
It has previously been an open problem whether all Boolean submodular fu...
read it
David A. Cohen
is this you? claim profile