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).
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received July 10, 1995, and in revised form May 20, 1996.
Rights and permissions
About this article
Cite this article
Barvinok, A. Computing Mixed Discriminants, Mixed Volumes, and Permanents . Discrete Comput Geom 18, 205–237 (1997). https://doi.org/10.1007/PL00009316
Issue Date:
DOI: https://doi.org/10.1007/PL00009316