Simpler Partial Derandomization of PPSZ for k-SAT

01/17/2020

∙

by   S. Cliff Liu, et al.

∙

0

∙

share

We give a simpler derandomization of the best known k-SAT algorithm PPSZ [FOCS'97, JACM'05] for k-SAT with sub-exponential number of solutions. The existing derandomization uses a complicated construction of small sample space, while we only use hashing. Our algorithm and theorem also have a nice byproduct: It outperforms the current fastest deterministic k-SAT algorithm when the formula has moderately exponential number of solutions.