A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix
Year: 2026
Type: preprint
Abstract: 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$.
Source: arXiv (Cornell University)
Authors: Dong, Dingding, Jain, Vishesh
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7212258185