A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary

Discrete and Computational Geometry

Volumn 27, Issue 4, 2002, Pages 531-550

  Gurvits, Leonid ^a   Samorodnitsky, Alex ^b,c  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035999219     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0083-2     Document Type: Article

References (26)

1. A. Aleksandrov, On the theory of mixed volumes of convex bodies, IV, Mixed discriminants and mixed volumes. Mat. Sb. (N.S.), 3 (1938), 227-251 (in Russian).
2. M. Avriel, Nonlinear Programming: Analysis and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1976.
3. R. B. Bapat, Mixed discriminants of positive semidefinite matrices, Linear Algebra Appl., 126, 107-124, 1989.
4. R. B. Bapat and T. E. S. Raghavan, Nonnegative Matrices and Applications, Cambridge University Press, Cambridge, 1997.
5. I. Bárány and Z. Furedi, Computing the volume is difficult, Discrete Comput. Geom., 2 (1987), 319-326.
6. A. I. Barvinok, Computing mixed discriminants, mixed volumes, and permanents, Discrete Comput. Geom., 18 (1997), 205-237.
7. A. I. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Struct. Algorithms, 14 (1999), 29-61.
8. M. Dyer and A. Frieze, The complexity of computing the volume of a polyhedron, SIAM J. Comput., 17 (1988), 967-994.
9. M. Dyer, P. Gritzmann and A. Hufnagel, On the complexity of computing mixed volumes, SIAM J. Comput., 27(2) (1998), 356-400.
10. J. Edmonds, Submodular functions, matroids, and certain polyhedra, in Combinatorial Structures and Their Applications (R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds.), Gordon and Breach, New York, 1970, pp. 69-87.
11. G. P. Egorychev, The solution of van der Waerden's problem for permanents, Adv. in Math., 42 (1981), 299-305.
12. D. I. Falikman, Proof of the van der Waerden's conjecture on the permanent of a doubly stochastic matrix, Mat. Zametki, 29(6) (1981), 931-938, 957 (in Russian).
13. S. Friedland, A lower bound for the permanent of a doubly stochastic matrix, Ann. of Math., 110(1979), 167-176.
14. C. D. Godsil, Algebraic Combinatorics, Chapman and Hall, London, 1993.
15. M. Grötschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
16. L. Gurvits, Van der Waerden conjecture for mixed discriminants, Adv. in Math., to appear.
17. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput., 18 (1989), 1149-1178.
18. M. Jerrum, A. Sinclair and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, Proc. 33rd ACM Symp. on Theory of Computing, 2001.
19. F. John, Extremum problems with inequalities as subsidiary conditions, in Studies and Essays, Presented to R. Courant on His 60th Birthday, Interscience, New York, 1948.
20. B. Kalantari and L. Khachian, On the complexity of nonnegative matrix scaling, Linear Algebra Appl., 240 (1996), 87-104.
21. N. Linial, A. Samorodnitsky and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Proc. 30th ACM Symp. on Theory of Computing, 1998.
22. A. Nemirovski and U. Rothblum, On complexity of matrix scaling, Linear Algebra Appl. 302/303 (1999), 435-460.
23. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
24. A. Panov, On mixed discriminants connected with positive semidefinite quadratic forms, Soviet Math. Dokl., 31 (1985).
25. R. Schneider, Convex Bodies: The Brunn-Minkowski Theory, Encyclopedia of Mathematics and Its Applications, vol. 44. Cambridge University Press, New York, 1993.
26. L. G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci., 8(2) (1979), 189-201.