Prefer a chat interface with context about you and your work?
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices
We design a deterministic polynomial time cn approximation algorithm for the permanent of positive semidefinite matrices where c = <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">γ+1</sup> ≃ 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 …