78 citations · 116 across the 14 of their papers we have counts for
1 paper · 1 filter
Andrei Krokhin, Dániel Marx
We study the complexity of local search for the Boolean constraint satisfaction problem (CSP), in the following form: given a CSP instance, that is, a collection of constraints, an…