Fetching the paper…
Reading the bibliography…
Let $\Phi = (V, \mathcal{C})$ be a constraint satisfaction problem on variables $v_1,\dots, v_n$ such that each constraint depends on at most $k$ variables and such that each variable assumes values in an alphabet of size at most $[q]$.
Problems and results on 3-chromatic hypergraphs and some related questions
Paul Erdős and László Lovász · 1973
Earlier work this paper cites.
A polynomial algorithm in linear programming
Leonid Genrikhovich Khachiyan · 1979
Earlier work this paper cites.
A parallel algorithmic version of the local lemma
Noga Alon · 1991
Earlier work this paper cites.
An algorithmic approach to the Lovász local lemma. I
József Beck · 1991
Earlier work this paper cites.
Further algorithmic aspects of the local lemma
Michael Molloy and Bruce Reed · 1998
Earlier work this paper cites.
The probabilistic method
Noga Alon and Joel H Spencer · 2004
Earlier work this paper cites.
Improved algorithmic versions of the Lovász local lemma
Aravind Srinivasan · 2008
Cited alongside, same era.
A constructive proof of the Lovász local lemma
Robin A Moser · 2009
Cited alongside, same era.
A constructive proof of the general Lovász local lemma
Robin A Moser and Gábor Tardos · 2010
Cited alongside, same era.
New constructive aspects of the Lovász local lemma
Bernhard Haeupler, Barna Saha, and Aravind Srinivasan · 2011
Cited alongside, same era.
Beyond the Lovász local lemma: Point to set correlations and their algorithmic applications
Dimitris Achlioptas, Fotis Iliopoulos, and Alistair Sinclair · 2019
Cited alongside, same era.
Approximation via correlation decay when strong spatial mixing fails
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, and Daniel Stefankovic · 2019
Cited alongside, same era.
Uniform sampling through the Lovász local lemma
Heng Guo, Mark Jerrum, and Jingcheng Liu · 2019
Later among the works it cites.
Counting hypergraph colorings in the local lemma regime
Heng Guo, Chao Liao, Pinyan Lu, and Chihao Zhang · 2019
Later among the works it cites.
Rapid mixing of hypergraph independent sets
Jonathan Hermon, Allan Sly, and Yumeng Zhang · 2019
Later among the works it cites.
Approximate counting, the Lovász local lemma, and inference in graphical models
Ankur Moitra · 2019
Later among the works it cites.
Fast sampling and counting k-SAT solutions in the local lemma regime
Weiming Feng, Heng Guo, Yitong Yin, and Chihao Zhang · 2020
Closest in time.
Sampling constraint satisfaction solutions in the local lemma regime
Weiming Feng, Kun He, and Yitong Yin · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Closest in time.