Pages that link to "Item:Q3191969"

The following pages link to A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) (Q3191969):

Displayed 4 items.

• Testing hypergraph colorability (Q1770424) ‎ (← links)
• How Many Conflicts Does It Need to Be Unsatisfiable? (Q3502712) ‎ (← links)
• The Lovász Local Lemma and Satisfiability (Q3644712) ‎ (← links)
• A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508) ‎ (← links)