Computing mixed discriminants, mixed volumes, and permanents

Discrete and Computational Geometry

Volumn 18, Issue 2, 1997, Pages 205-237

  Barvinok, A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031536363     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009316     Document Type: Article

References (22)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A. D. Aleksandrov, On the theory of mixed volumes of convex bodies, IV, Mixed discriminants and mixed volumes (in Russian), Mat. Sb. (N.S.) 3 (1938), 227-251.
3. A. I. Barvinok, Two algorithmic results for the Traveling Salesman Problem, Math. Oper. Res. 21 (1996), 65-84.
4. M. Dyer, P. Gritzmann, and A. Hufnagel, On the complexity of computing mixed volumes, to appear.
5. G. P. Egorychev, The solution of van der Waerden's problem for permanents. Adv. in Math. 42 (1981), 299-305.
6. A. Frieze and M. Jerrum, An analysis of a Monte Carlo algorithm for estimating the permanent, Combinatorica, 15 (1995), 67-83.
7. F. R. Gantmakher, The Theory of Matrices, Chelsea, New York, 1960.
8. D. Yu. Grigoriev and M. Karpinsky, The matching problem for bipartite graphs with polynomially bounded permanents is in NC, Proc. Twenty-Eighth Annual IEEE Symp. Foundations of Computer Science, IEEE Computer Society Press, Washington, DC, 1987, pp. 162-172.
9. P. Gritzmann and V. Klee, On the complexity of some basic problems in computational convexity: II. Volume and mixed volumes, In: Polytopes: Abstract, Convex, and Computational (T. Bisztriczky, P. McMullen, R. Schneider, and A. Ivić Weiss, eds.), Proceedings of the NATO Advanced Study Institute, Scarborough, Ontario, Canada, August 20-September 3, 1993, 1994, Kluwer Academic, Amsterdam, pp. 373-466.
10. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
11. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput. 18 (1989), 1149-1178.
12. L. Khachiyan, Rounding of polytopes in the real number model of computation, Math. Oper. Res. 21 (1996), 307-320.
13. L. Khachiyan and M. Todd, On the complexity of approximating the maximal inscribed ellipsoid for a polytope, Math. Programming, 61 (1993), 137-159.
14. R. Latala, On the equivalence between geometric and arithmetic means for logconcave measures, Preprint.
15. K. Leichtweiß, Convexity and Differential Geometry, In: Handbook of Convex Geometry, vol. B, Chapter 4.1 (P. M. Gruber and J. M. Wills, eds.), North-Holland, Amsterdam, 1993, pp. 1045-1080.
16. E. Lutwak, Mixed projection inequalities, Trans. Amer. Math. Soc. 287 (1985), 91-105.
17. V. D. Milman and G. Schechtman, Asymptotic Theory of Finite Dimensional Normed Spaces. With an Appendix by M. Gromov, "Isoperimetric Inequalities in Riemannian Manifolds," Lecture Notes in Mathematics, vol. 1200, Springer-Verlag, Berlin, 1986.
18. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1982.
19. L. E. Rasmussen, Approximating the permanent: A simple approach, Random Structures and Algorithms 5 (1994), 349-361.
20. L. A. Santalo, Integral Geometry and Geometric Probability, Addison-Wesley, Reading, MA, 1976.
21. R. Schneider, Convex Bodies: The Brunn-Minkowski Theory, Encyclopedia of Mathematics and Its Applications, vol. 44, Cambridge University Press, New York, 1993.
22. R. Schneider and J. A. Wieacker, Integral geometry, In: Handbook of Convex Geometry, vol. B, Chapter 5.1 (P. M. Gruber and J. M. Wills, eds.), North-Holland, Amsterdam, 1993, pp. 1351-1390.