Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments

Per Austrin, Ioana O. Bercea, Mayank Goswami +2

Given a $k$-CNF formula and an integer $s$, we study algorithms that obtain $s$ solutions to the formula that are maximally dispersed. For $s=2$, the problem of computing the diame…