A Study of Parallel Continuous Local Search

In three linesStudy of parallel Continuous Local Search (CLS) for Boolean satisfiability with symmetric pseudo-Boolean constraints. Authors relax the SAT problem to continuous optimization on an n-dimensional hypercube and find that redundant constraints inhibit convergence, CLS works well as a hybrid sub-solver, and convergence plateaus quickly on saddle-dense objectives.

Summary generated by Claude — human-verified