scientific article

zbMath1192.68837MaRDI QIDQ3579374

Aravind Srinivasan

Publication date: 6 August 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (8)

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

This page was built for publication: