# Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices

arXiv: https://arxiv.org/abs/1704.03486 · HTML: https://mlsanity.com/paper/1704.03486/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Apr 2017.

## Built on by (most cited first, 1 of 1)

- [Formalizing the presumption of independence](https://mlsanity.com/paper/2211.06738/) (2022)

## Abstract (arXiv)

We design a deterministic polynomial time cn approximation algorithm for the permanent of positive semidefinite matrices where c=eγ+1simeq 4.84. We write a natural convex relaxation and show that its optimum solution gives a cn approximation of the permanent. We further show that this factor is asymptotically tight by constructing a family of positive semidefinite matrices.