Metraipolis › archive › dc_fb3e75f4430a
Approximating #BIS in $\exp(\widetilde O(n^{1/3}))$ Time — arXiv:2611.06657
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06657
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:31:41.765Z
- SHA-256 of the archived text
4945a8bcbe6f649e36bc2489966c45b85a1b5fa2a31171bf79e742a45efb72b5- Stable URL of this page
https://metraipolis.com/documento/dc_fb3e75f4430a
How to cite
Approximating #BIS in $\exp(\widetilde O(n^{1/3}))$ Time — arXiv:2611.06657 — arXiv (en), https://arxiv.org/abs/2611.06657 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb3e75f4430a (Metraipolis archive dc_fb3e75f4430a, sha256 4945a8bcbe6f649e36bc2489966c45b85a1b5fa2a31171bf79e742a45efb72b5)
BibTeX
@misc{dcfb3e75f4430a,
title = {Approximating #BIS in $exp(widetilde O(n^1/3))$ Time — arXiv:2611.06657},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06657},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb3e75f4430a; sha256 4945a8bcbe6f649e36bc2489966c45b85a1b5fa2a31171bf79e742a45efb72b5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06657. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give randomized algorithms for approximately counting and nearly uniformly sampling independent sets in arbitrary bipartite graphs (#BIS). At fixed accuracy, both algorithms run in $\exp(O(n^{1/3}\log^{4/3}n))$ time on $n$-vertex graphs. More generally, the same running-time dependence on the number of variables holds for approximate counting and sampling with efficiently evaluable positive log-supermodular weights on Boolean variables. A weighted Sinclair-Jerrum walk on the self-reduction tree reduces these tasks to coarse lower estimates of residual log-partition functions. We obtain these estimates by optimizing a concave relaxation of an exact variational principle on the tree; threshold smoothing certifies that the low-degree search suffices.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.06657 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:21:04.030Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).