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):

Displaying 7 items.

• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
• 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)
• (Q5869336) (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)