Using deep learning to construct stochastic local search SAT solvers with performance bounds

Maximilian J. Kramer, Paul Boes, Jens Eisert

The Boolean Satisfiability problem (SAT), as the prototypical $\mathsf{NP}$-complete problem, is crucial in both theoretical computer science and practical applications. To address…