Computing Mixed Discriminants, Mixed Volumes, and Permanents

Abstract

We construct a probabilistic polynomial time algorithm that computes the mixed discriminant of given n positive definite $n \times n$ matrices within a 2 O(n) factor. As a corollary, we show that the permanent of an $n \times n$ nonnegative matrix and the mixed volume of n ellipsoids in R n can be computed within a 2 O(n) factor by probabilistic polynomial time algorithms. Since every convex body can be approximated by an ellipsoid, the last algorithm can be used for approximating in polynomial time the mixed volume of n convex bodies in R n within a factor n O(n) .