Metraipolis › archive › dc_435997cc5961
A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix — arXiv:2609.11049
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11049
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:16:15.553Z
- SHA-256 of the archived text
cec7a3eb40db4503e3ef3de0bdf0102763e0dbdbbf5765b47d17b9a469a6d4f9- Stable URL of this page
https://metraipolis.com/documento/dc_435997cc5961
How to cite
A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix — arXiv:2609.11049 — arXiv (en), https://arxiv.org/abs/2609.11049 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_435997cc5961 (Metraipolis archive dc_435997cc5961, sha256 cec7a3eb40db4503e3ef3de0bdf0102763e0dbdbbf5765b47d17b9a469a6d4f9)
BibTeX
@misc{dc435997cc5961,
title = {A deterministic $(1+varepsilon)^n$ approximation for the permanent of a nonnegative matrix — arXiv:2609.11049},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11049},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_435997cc5961; sha256 cec7a3eb40db4503e3ef3de0bdf0102763e0dbdbbf5765b47d17b9a469a6d4f9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11049. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.11049 — 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-10-16T05:59:08.323Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).