arXiv (All)
open access
A Counting and Sampling Lovász Local Lemma
We establish counting and sampling analogues of the Lovász Local Lemma: we give efficient algorithms for approximately counting and exactly sampling satisfying assignments of general constraint satisfaction problems (CSPs) in the local lemma regime $$4 \mathrm{e} p (D+1)^2\leq 1, $$ where $p$ is the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quasi-uniform designs from random candidates: optimal candidate complexity and farthest-point sampling#973598
- Verifying Sampling Algorithms via Distributional Invariants / Daniel Zilken, Kevin Batz, Joost-Pieter Katoen, Tobias Winkler#780428
- Efficient Rejection Sampling in the Entropy-Optimal Range#173267
- Multinomial probabilities near the mode: integer modes and the complete local expansion#1033998
- The Scaling Window of Random $k$-SAT#1062122
Record · ID 1077930
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive