Problem
Research questions and friction points this paper is trying to address.
deterministic
approximation
permanent
nonnegative matrix
A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix
🤖 AI Summary
本文提出了一种确定性多项式时间算法，用于非负矩阵的永久值计算，该算法能够以(1+ε)^n的近似比估计永久值。
📝 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$.
Innovation
Methods, ideas, or system contributions that make the work stand out.
deterministic algorithm
permanent of nonnegative matrix
strongly polynomial time
🔎 Similar Papers
