One-Shot Learning for k-SAT

Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang

Consider a $k$-SAT formula $\Phi$ where every variable appears at most $d$ times. Let $\sigma$ be a satisfying assignment, sampled proportionally to $e^{\beta m(\sigma )}$ where $m(\sigma )$ is the number…