A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 48-57

  Gurvits, Leonid ^a   Samorodnitsky, Alex ^b  

^a NECI   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX BODY; DOUBLY STOCHASTIC MATRIX; MULTIPLICATIVE FACTORS; N-TUPLES; POLYNOMIAL ALGORITHM; POLYNOMIAL-TIME ALGORITHMS; POSITIVE SEMIDEFINITE MATRICES; UPPER AND LOWER BOUNDS; SEMIDEFINITE MATRICES; VAN DER WAERDEN-FALIKMAN-EGORYCHEV THEORY;

POLYNOMIALS; THEOREM PROVING; COMPUTATIONAL METHODS; MATRIX ALGEBRA; RANDOM PROCESSES;

ALGORITHMS;

EID: 0033727271     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335311     Document Type: Conference Paper

References (22)

1. A. Aleksandrov, On the theory of mixed volumes of convex bodies, IV, Mixed discriminants and mixed volumes (in Russian), Mat. Sb. (N.S.) 3:227-251, 1938.
2. M. Avriel, Nonlinear programming: analysis and methods, Prentice-Hall, 1976.
3. I. Barany and Z. Furedi, Computing the volume is difficult, Discrete & Computational Geometry, 2:319-326, 1987.
4. R. Bapat, Mixed discriminants of positive semidefinite matrices, Linear Algebra and its Applications 126:107-124, 1989.
5. A. I. Barvinok, Computing Mixed Discriminants, Mixed Volumes, and Permanents, Discrete & Computational Geometry, 18:205-237 (1997).
6. A. I. Barvinok, A simple polynomial time algorithm to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures and Alg., 14:29-61, 1999.
7. M. Dyer and A. Frieze, The complexity of computing the volume of a polyhedron, SIAM J. Comput., 17:967-994, 1988.
8. M. Dyer, P. Gritzmann and A. Hufnagel, On the complexity of computing mixed volumes, SIAM J. Comput., 27(2):356-400, 1998. (Pubitemid 128497661)
9. 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, 69-87, 1970.
10. G.P. Egorychev, The solution of van der Waerden's problem for permanents, Advances in Math., 42:299-305, 1981.
11. D. I. Falikman, Proof of the van der Waerden's conjecture on the permanent of a doubly stochastic matrix, Mat. Zametki 29(6):931-938, 957, 1981, (in Russian).
12. S. Friedland, A lower bound for the permanent of a doubly stochastic matrix, Annals of Mathematics, 110:167-176, 1979.
13. M. Grötschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
14. L. Gurvits, Proving Generalized van der Waerden Conjecture - A proof of Bapat's conjecture on mixed discriminants, preprint, 1999.
15. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput., 18:1149-1178, 1989. (Pubitemid 20613573)
16. F. John, Extremum problems with inequalities as subsidiaxy conditions, Studies and Essays, presented to R. Courant on his 60th birthday, Interscience, New York, 1948.
17. N. Karmarkar, R. Karp, R. Lipton, L. Lovasz and M. Luby, A Monte-Carlo algorithm for estimating the permanent, SIAM J. Comput., 22(2):284-293, 1993.
18. N. Linial, A. Samorodnitsky and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Proc. 30 ACM Symp. on Theory of Computing, ACM, New York, 1998.
19. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
20. A. Panov, On mixed discriminants connected with positive semidefinite quadratic forms, Soviet Math. Dokl. 31 (1985).
21. R. Schneider, Convex bodies: The Brunn-Minkowski Theory, Encyclopedia of Mathematics and Its Applications, vol. 44, Cambridge University Press, New York, 1993.
22. L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, 8(2):189-201, 1979.