Latest version: v0.1.0
The information on this page was curated by experts in our Cybersecurity Intelligence Team.
A Python tool that implements Lovasz Local Lemma's application on The Boolean Satisfiability (SAT) problem, which includes an instance geneartor,an algorithm (decision procedure), which decide that if a SAT instance satisfies in local lemma regime, and a solver can find solution or sample a uniform random solution in the local lemma regime.
No known vulnerabilities found