Simpler Partial Derandomization of PPSZ for $k$-SAT
Computational Complexity
2020-01-22 v1
Abstract
We give a simpler derandomization of the best known -SAT algorithm PPSZ [FOCS'97, JACM'05] for -SAT with \emph{sub-exponential} number of solutions. The existing derandomization uses a complicated construction of small sample space, while we only use \emph{hashing}. Our algorithm and theorem also have a nice byproduct: It outperforms the current fastest deterministic -SAT algorithm when the formula has \emph{moderately exponential} number of solutions.
Keywords
Cite
@article{arxiv.2001.06536,
title = {Simpler Partial Derandomization of PPSZ for $k$-SAT},
author = {S. Cliff Liu},
journal= {arXiv preprint arXiv:2001.06536},
year = {2020}
}