The Lovász Local Lemma and Satisfiability-Reference-Cited by-同舟云学术

The Lovász Local Lemma and Satisfiability

Published:2009 Issue: Volume: Page:30-54
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Gebauer Heidi,Moser Robin A.,Scheder Dominik,Welzl Emo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03456-5_3

Reference37 articles.

1. Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. John Wiley & Sons Inc., Chichester (2008)

2. Erdős, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Hajnal, A., Rado, R., Sós, V.T. (eds.) Infinite and Finite Sets (to Paul Erdős on his 60th birthday), vol. II, pp. 609–627. North-Holland, Amsterdam (1975)

3. Erdős, P.: On a combinatorial problem. Nordisk Mat. Tidskr. 11, 5–10, 40 (1963)

4. Erdős, P.: On a combinatorial problem. II. Acta Math. Acad. Sci. Hungar. 15, 445–447 (1964)

5. Shearer, J.B.: On a problem of Spencer. Combinatorica 5(3), 241–245 (1985)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On connectivity in random graph models with limited dependencies;Random Structures & Algorithms;2024-04-22

2. A General Framework for Hypergraph Coloring;SIAM Journal on Discrete Mathematics;2022-07-14

3. On simplified NP-complete variants of Monotone 3 -Sat;Discrete Applied Mathematics;2021-03

4. Quantum Lovász local lemma: Shearer’s bound is tight;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23

5. Algorithmic Aspects on the Construction of Separating Codes;Lecture Notes in Computer Science;2019