Polynomial Time Algorithms to Approximat
โ
Alexander Barvinok
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 308 KB
We present real, complex, and quaternionic versions of a simple randomized polynomial time algorithm to approximate the permanent of a nonnegative matrix and, more generally, the mixed discriminant of positive semidefinite matrices. The algorithm provides an unbiased estimator, which, with high prob