We investigate the complexity of local search based on steepest ascent. ...
Local search is widely used to solve combinatorial optimisation problems...
Singleton arc consistency is an important type of local consistency whic...
Variable or value elimination in a constraint satisfaction problem (CSP)...
We study the complexity of constraint satisfaction problems involving gl...
The constraint satisfaction problem (CSP) is a general problem central t...
It has previously been an open problem whether all Boolean submodular
fu...