The Local Lemma Is Asymptotically Tight for SAT

@article{Gebauer2016TheLL,
  title={The Local Lemma Is Asymptotically Tight for SAT},
  author={Heidi Gebauer and Tibor Szab{\'o} and G{\'a}bor Tardos},
  journal={J. ACM},
  year={2016},
  volume={63},
  pages={43:1-43:32}
}
The Local Lemma is a fundamental tool of probabilistic combinatorics and theoretical computer science, yet there are hardly any natural problems known where it provides an asymptotically tight answer. The main theme of our article is to identify several of these problems, among them a couple of widely studied extremal functions related to certain restricted versions of the k-SAT problem, where the Local Lemma does give essentially optimal answers. As our main contribution, we construct… CONTINUE READING
7 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Similar Papers

Loading similar papers…