Pages that link to "Item:Q3644712"
From MaRDI portal
The following pages link to The Lovász Local Lemma and Satisfiability (Q3644712):
Displaying 13 items.
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- Waiter-client and client-waiter colourability and \(k\)-SAT games (Q2363109) (← links)
- Obtaining Finite Local Theory Axiomatizations via Saturation (Q2849490) (← links)
- A quantum Lovász local lemma (Q2875141) (← links)
- ON THE LOCAL-INDICABILITY COHEN–LYNDON THEOREM (Q3094648) (← links)
- The Local Lemma Is Asymptotically Tight for SAT (Q3177819) (← links)
- Commutativity in the Algorithmic Lovász Local Lemma (Q4555400) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- (Q5206547) (← links)
- On connectivity in random graph models with limited dependencies (Q6596388) (← links)
- An algorithmic construction of union-intersection-bounded families (Q6615223) (← links)
- Combinatorial constructions of separating codes (Q6649717) (← links)
