A new algorithmic upper bound for permanents via a permanental Schur inequality, but the proof has an off-by-one recurrence error and a flawed PSD lemma.
Simply exponential approximation of the permanent of positive semidefinite matrices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
A new algorithmic upper bound for permanents via a permanental Schur inequality, but the proof has an off-by-one recurrence error and a flawed PSD lemma.