Fetching the paper…
Reading the bibliography…
The Lovasz Local Lemma (LLL) is a powerful tool in probability theory to show the existence of combinatorial objects meeting a prescribed collection of "weakly dependent" criteria.
On representatives of subsets
P. Hall · 1935
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Weighted sums of certain dependent random variables
K. Azuma · 1967
Earlier work this paper cites.
Problems and results on 3-chromatic hypergraphs and some related questions
P. Erdös and L. Lovász · 1975
Earlier work this paper cites.
Asymptotic lower bounds for Ramsey functions
J. Spencer · 1977
Earlier work this paper cites.
Decomposition problems for multiple coverings with unit balls
P. Mani-Levitska and J. Pach · 1987
Earlier work this paper cites.
A parallel algorithmic version of the local lemma
N. Alon · 1991
Earlier work this paper cites.
An algorithmic approach to the Lovász local lemma
J. Beck · 1991
Earlier work this paper cites.
Mick gets some (the odds are on his side)
V. Chvátal and B. Reed · 1992
Earlier work this paper cites.
A threshold for unsatisfiability
A. Goerdt · 1992
Earlier work this paper cites.
Critical behavior in the satisfiability of random boolean expressions
S. Kirkpatrick and B. Selman · 1994
Earlier work this paper cites.
Graph Theory (Graduate Texts in Mathematics)
R. Diestel · 1997
Earlier work this paper cites.
Linear algebra and geometry
A.I. Kostrikin · 1997
Earlier work this paper cites.
Further algorithmic aspects of the local lemma
M. Molloy and B. Reed · 1998
Cited alongside, same era.
Sharp thresholds of graph properties, and the k-Sat problem
E. Friedgut · 1999
Cited alongside, same era.
Coloring non-uniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
A. Czumaj and C. Scheideler · 2000
Cited alongside, same era.
The scaling window of the 2-SAT transition
B. Bollobás, C. Borgs, J.T. Chayes, J.H. Kim, and D.B. Wilson · 2001
Cited alongside, same era.
Random Graphs
B. Bollobás · 2001
Cited alongside, same era.
Relations between average case complexity and approximation complexity
Uriel Feige · 2002
Cited alongside, same era.
Consistency of local density matrices is QMA-Complete
Y.K. Liu · 2006
Later among the works it cites.
On the complexity of computing Zero-Error and Holevo capacity of quantum channels
S. Beigi and P.W. Shor · 2007
Later among the works it cites.
The complexity of the consistency and n-representability problems for quantum states
Y.K. Liu · 2007
Later among the works it cites.
Complexity of stoquastic frustration-free hamiltonians
S. Bravyi and B. Terhal · 2008
Later among the works it cites.
J. Diaz, L. Kirousis, D. Mitsche, and X. Perez-Gimenez · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Analytic and algorithmic solution of random satisfiability problems
M. Mezard, G. Parisi, and R. Zecchina · 2002
Cited alongside, same era.
The satisfiability threshold of random 3-SAT is at least 3.52
M.T. Hajiaghayi and G.B. Sorkin · 2003
Cited alongside, same era.
Selecting complementary pairs of literals
A.C. Kaporis, L.M. Kirousis, and E. Lalas · 2003
Cited alongside, same era.
The threshold for random k-SAT is 2ˆ k log 2-O (k)
D. Achlioptas and Y. Peres · 2004
Cited alongside, same era.
The probabilistic method
N. Alon and J.H. Spencer · 2004
Cited alongside, same era.
Clustering of solutions in the random satisfiability problem
M. Mézard, T. Mora, and R. Zecchina · 2005
Cited alongside, same era.
Derandomizing the Lovász local lemma more effectively
R.A. Moser · 2008
Later among the works it cites.
Improved algorithmic versions of the Lovász local lemma
A. Srinivasan · 2008
Later among the works it cites.
Bounds on the quantum satisfibility threshold
S. Bravyi, C. Moore, and A. Russell · 2009
Closest in time.
A Kolmogorov Complexity Proof of the Lovász Local Lemma
L. Fortnow · 2009
Closest in time.
On product, generic and random generic quantum satisfiability
C.R. Laumann, A.M. Läuchli, R. Moessner, A. Scardicchio, and S. L Sondhi · 2009
Closest in time.
Phase transitions and random quantum satisfiability
C.R. Laumann, R. Moessner, A. Scardicchio, and S.L. Sondhi · 2009
Closest in time.
A constructive proof of the Lovász Local Lemma
R.A. Moser · 2009
Closest in time.
A constructive proof of the general Lovász Local Lemma
R.A. Moser and G. Tardos · 2009
Closest in time.