Pages that link to "Item:Q5172728"
From MaRDI portal
The following pages link to A constructive proof of the Lovász local lemma (Q5172728):
Displaying 37 items.
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- Certifying algorithms (Q465678) (← links)
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Grasshopper avoidance of patterns (Q727190) (← links)
- A short implicant of a CNF formula with many satisfying assignments (Q727982) (← links)
- Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas (Q743431) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Star-factors in graphs with large minimum degree (Q1791704) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Probabilistic existence of large sets of designs (Q2194761) (← links)
- A new bound on the acyclic edge chromatic number (Q2198378) (← links)
- Directed Lovász local lemma and Shearer's lemma (Q2294597) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Total functions in QMA (Q2684235) (← links)
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
- A Short Implicant of a CNF Formula with Many Satisfying Assignments (Q2942635) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- (Q5009540) (← links)
- A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← links)
- Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions (Q6571302) (← links)
- An algorithmic construction of union-intersection-bounded families (Q6615223) (← links)
- Combinatorial constructions of separating codes (Q6649717) (← links)
