scientific article; zbMATH DE number 5764785

zbMATH Open1192.68837MaRDI QIDQ3579374FDOQ3579374

Authors: Aravind Srinivasan 

Publication date: 6 August 2010

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cited In (8)

• A Kolmogorov complexity proof of the Lovász local lemma for satisfiability
• Distributed algorithms for the Lovász local lemma and graph coloring
• Randomly colouring graphs (a combinatorial view)
• The Lovász Local Lemma and Satisfiability
• Rainbow Hamilton cycles and lopsidependency
• Asymptotically optimal frugal colouring
• Commutative algorithms approximate the LLL-distribution
• Finding independent transversals efficiently

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579374)