David A. Cohen | DeepAI

AI Chat

Featured Co-authors

Stanislav Zivny
37 publications
Martin C. Cooper
16 publications
András Z. Salamon
6 publications
Clement Carbonnel
6 publications
Evgenij Thorstensen
5 publications
Guillaume Escamocher
5 publications
Páidí Creed
4 publications
Artem Kaznatcheev
4 publications
Mark Wallace
4 publications
Peter G. Jeavons
3 publications

∙ 11/19/2019

Steepest ascent can be exponential in bounded treewidth problems

We investigate the complexity of local search based on steepest ascent. ...

0 David A. Cohen, et al. ∙

∙ 07/02/2019

Representing fitness landscapes by valued constraints to understand the complexity of local search

Local search is widely used to solve combinatorial optimisation problems...

0 Artem Kaznatcheev, et al. ∙

∙ 04/20/2017

On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns

Singleton arc consistency is an important type of local consistency whic...

0 Clement Carbonnel, et al. ∙

∙ 02/12/2015

Variable and value elimination in binary constraint satisfaction via forbidden patterns

Variable or value elimination in a constraint satisfaction problem (CSP)...

0 David A. Cohen, et al. ∙

∙ 07/10/2013

Tractable Combinations of Global Constraints

We study the complexity of constraint satisfaction problems involving gl...

0 David A. Cohen, et al. ∙

∙ 03/08/2011

The tractability of CSP classes defined by forbidden patterns

The constraint satisfaction problem (CSP) is a general problem central t...

0 David A. Cohen, et al. ∙

∙ 11/12/2008

The Expressive Power of Binary Submodular Functions

It has previously been an open problem whether all Boolean submodular fu...

0 Stanislav Zivny, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world