A kolmogorov complexity proof of the lovász local lemma for satisfiability
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
Journal of the ACM (JACM)
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability
Theoretical Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
European Journal of Combinatorics
Acyclic edge coloring of planar graphs with girth at least 5
Discrete Applied Mathematics
| Hi-index | 0.00 |
The Lovasz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results without supplying any efficient way of solving the corresponding algorithmic problems. J. Beck recently has found a method for converting some of these existence proofs into efficient algorithmic procedures, at the cost of losing a little in the estimates. His method does not seem to be parallelizable. Here we modify his technique and achieve an algorithmic version that can be parallelized, thus obtaining deterministic NCl algorithms for several interesting algorithmic problems. © 1991 Wiley Periodicals, Inc.