A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

Dingding Dong, Vishesh Jain

Source record

Source: arXiv

Published: Sep 10, 2026

arXiv: 2609.11049

Open original source ↗

Source 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$ .

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix — Mathematical Frontier Network