scientific article; zbMATH DE number 5764785

MaRDI QIDQ3579374zbMATH OpenFDO

Authors Aravind Srinivasan

Publication date 6 August 2010

Mathematics Subject Classification ID

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

Cited in

(9)

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

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)