arXiv · 2611.18720
A Las Vegas algorithm for satisfiable SAT formulas, with an application to timetabling
Abstract
Many scheduling problems need many different feasible timetables, and a view of how much freedom each event has. We study a Las Vegas algorithm that samples satisfying assignments of a Boolean formula one variable at a time: it draws each value from an estimate of its conditional probability, propagates, and restarts on a contradiction. Every output is a checked solution and comes with the exact probability of producing it. We prove that a run succeeds with probability at least $2^{-K}$, where $K$ is the expected Kullback--Leibler divergence between the true and estimated conditional probabilities along the run of a uniform solution. We also bound the distance of the outputs from uniform from the samples alone; it is a divergence in the opposite direction to $K$, so a sampler can succeed more often while being farther from uniform. On generated timetabling instances counted exactly, belief propagation on the timetabling problem brings $K$ to at most about one bit, and the estimated counts are within 2% of the exact ones. On a real university instance of the International Timetabling Competition 2019, rerunning only the failed runs delivered all 72 requested timetables with each of two estimators. Belief propagation succeeds in 31% of runs. Steered by a Markov chain that carries a nearly feasible timetable, it succeeds in 65% of runs, with outputs at least 300 bits from uniform. There the importance weights are too uneven to estimate the number of timetables, and we certify a lower bound instead. For random 3-SAT, an estimator whose $K$ grows logarithmically would give a polynomial-time Las Vegas algorithm beyond the densities at which any algorithm is proved to succeed; we conjecture that one exists below the satisfiability threshold.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Fabio Dias. 2026-11-08. A Las Vegas algorithm for satisfiable SAT formulas, with an application to timetabling. https://searcharxiv.com/abs/2611.18720
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.