Faster Randomized Branching Algorithms for $r$-SAT

R. Krithika, N. S. Narayanaswamy

The problem of determining if an $r$-CNF boolean formula $F$ over $n$ variables is satisifiable reduces to the problem of determining if $F$ has a satisfying assignment with a Hamm…