48 citations · 232 across the 19 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DM2019★ 2 cited
Steepest ascent can be exponential in bounded treewidth problems
David A. Cohen, Martin C. Cooper, Artem Kaznatcheev +1
We investigate the complexity of local search based on steepest ascent. We show that even when all variables have domains of size two and the underlying constraint graph of variabl…
cs.DS2019★ 3 cited
Variable elimination in binary CSPs
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability. We study variable-elimination rules…