A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary
A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary
复制标题
一种近似混合判别式和混合体积的确定性算法以及组合推论
DOI:
10.1007/s00454-001-0083-2
复制
发表时间:
2002
影响因子:
0.8
通讯作者:
Alex Samorodnitsky
中科院分区:
文献类型:
--
作者:
L. Gurvits;Alex Samorodnitsky
We present a deterministic polynomial-time algorithm that computes the mixed discriminant of an n -tuple of positive semidefinite matrices to within an exponential multiplicative factor. To this end we extend the notion of doubly stochastic matrix scaling to a larger class of n -tuples of positive semidefinite matrices, and provide a polynomial-time algorithm for this scaling. As a corollary, we obtain a deterministic polynomial algorithm that computes the mixed volume of n convex bodies in Rn to within an error which depends only on the dimension. This answers a question of Dyer, Gritzmann and Hufnagel. A ``side benefit'' is a generalization of Rado's theorem on the existence of a linearly independent transversal.