596 citations · 3k across the 50 of their papers we have counts for
1 paper · 2 filters
Daniel Sheldon, Neal E. Young
Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider…