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.
Cite
CITATION STYLE
APA
Achlioptas, D., Hammoudeh, Z. S., & Theodoropoulos, P. (2018). Fast Sampling of Perfectly Uniform Satisfying Assignments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10929 LNCS, pp. 135–147). Springer Verlag. https://doi.org/10.1007/978-3-319-94144-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free