A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Simpler Partial Derandomization of PPSZ for k-SAT
[article]
2020
arXiv
pre-print
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.
arXiv:2001.06536v1
fatcat:f6x2ca4aivdazjvur3ztx7pwdq