Parallel Algorithmic Lovász Local Lemma SAT Solver

A parallel implementation of DFS for Directed Acyclic Graphs (https://research.nvidia.com/publication/parallel-depth-first-search-directed-acyclic-graphs)

Some implementations of partial rejection samplers

Solve SAT using algorithmic Lovasz Local Lemma

This repository consists of python codes for perfect sampling using partial rejection sampling (PRS) proposed by Moka and Kroese (2019). This method combines discrete PRS of Guo et al. (2017) and d…

Applications and simulation of partial rejection sampling. Used for SPUR 2018.

SAT'18 Paper: SPUR - Satisfying Perfectly Uniform Random sampler (Winner Best Student Paper)

Uniform, random sampling: large study and results of different SAT-based samplers