Pages that link to "Item:Q4521547"
From MaRDI portal
The following pages link to Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547):
Displaying 6 items.
- An estimate for the probability of dependent events (Q956348) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- An algorithmic approach to the Lovász local lemma. I (Q3986105) (← links)
- A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508) (← links)
- Improved bounds and algorithms for hypergraph 2-coloring (Q4943351) (← links)