Fast Sampling of Perfectly Uniform Satisfying Assignments

Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos

Abstract: We present an algorithm for perfectly uniform sampling of satisfying assignments, based on the exact model counter sharpSAT and reservoir sampling. In experiments across several hundred formulas, our sampler is faster than the state of the art by 10 to over 100,000 times.