arXiv (All)
open access
A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix
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$.
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
- A Koteljanskii inequality for permanents#1145146
- Limit theorems for linear spectrum statistics of orthogonal polynomial ensembles and their applications in random matrix theory#366889
- The multiple Markov theorem on Angelesco sets#984032
- Structural Corrections to the Bethe Approximation of the Permanent#819088
- Structural Corrections to the Bethe Approximation of the Permanent#809096
Record · ID 998613
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