A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results—A Survey
A Faragó - Algorithms, 2021 - mdpi.com
A classic and fundamental result, known as the Lovász Local Lemma, is a gem in the
probabilistic method of combinatorics. At a high level, its core message can be described by …
probabilistic method of combinatorics. At a high level, its core message can be described by …
[PDF][PDF] Constraint satisfaction problems: Probabilistic approach and applications to social choice theory
J Livieratos - 2020 - comsoc-community.org
In this Ph. D thesis, we work in one of the most well studied class of problems in Computer
Science, that of Constraint Satisfaction Problems (CSPs). In one of their usual formulations …
Science, that of Constraint Satisfaction Problems (CSPs). In one of their usual formulations …
[图书][B] Local Bounds for the Independent Set Polynomial and the Probabilistic Method
K Zampetakis - 2022 - search.proquest.com
The independent set polynomial plays a prominent role in combinatorics, statistical
mechanics, and the probabilistic method. Specifically, in combinatorics the independent set …
mechanics, and the probabilistic method. Specifically, in combinatorics the independent set …