Algorithmic LLL k-CNF of max degree d with m clauses on n variables Theorem d≤2k-2 3 satisfying assignment for Theorem (Moser,2009) d<2k-3[ 〉 satisfying assignment can be found in O(n+km logm)w.h.p.satisfying assignment can be found in O(n + km logm) w.h.p. ∃ satisfying assignment for φ Algorithmic LLL Theorem d  2k￾2 Theorem (Moser, 2009) d < 2k￾3 φ : k-CNF of max degree d with m clauses on n variables