The Local Lemma Is Asymptotically Tight for SAT.
Heidi GebauerTibor SzabóGábor TardosPublished in: J. ACM (2016)
Keyphrases
- worst case
- lower bound
- sat solvers
- satisfiability problem
- upper bound
- sat problem
- johnson lindenstrauss
- stochastic local search algorithms
- phase transition
- search algorithm
- sat solving
- sample size
- max sat
- stochastic local search
- boolean satisfiability
- asymptotically optimal
- propositional satisfiability
- database
- central limit theorem
- knowledge base
- sat encodings
- objective function