On the complexity of computing mixed volumes

SIAM Journal on Computing

Volumn 27, Issue 2, 1998, Pages 356-400

  Dyer, Martin ^a   Gritzmann, Peter ^b   Hufnagel, Alexander ^c  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c NONE   (Germany)

Author keywords

Approximation; Computation; Computational complexity; Computational convexity; Convex body; Deterministic algorithm; Mixed volumes; Parallelotope; Polynomial time algorithm; Polytope; Randomized algorithm; Volume; Zonotope; hardness

Indexed keywords

EID: 0001599636     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794278384     Document Type: Article

References (82)

1. [Al37] A.D. ALEKSANDROV, On the theory of mixed volumes of convex bodies, II. New inequalities between mixed volumes and their applications, Math. Sb. N.S., 2 (1937), pp. 1205-1238 (in Russian).
2. [Al38] A.D. ALEKSANDROV, On the theory of mixed volumes of convex bodies, IV. Mixed discriminants and mixed volumes, Math. Sb. N.S., 3 (1938), pp. 227-251 (in Russian).
3. [AS86] E.L. ALLGOWER AND P.M. SCHMIDT, Computing volumes of polyhedra, Math. of Comp., 46 (1986), pp. 171-174.
4. [AK90] D. APPLEGATE AND R. KANNAN, Sampling and integration of near log-concave functions, in Proc. 23rd ACM Symp. on Theory of Computing, ACM, New York, 1990, pp. 156-163.
5. [BF86] I. BÁRÁNY AND Z. FÜREDI, Computing the volume is difficult, in Proc. 18th ACM Symp. on Theory of Computing, ACM, New York, 1986, pp. 442-447. Reprinted in Discrete Comput. Geom., 2 (1987), pp. 319-326.
6. [BF86] I. BÁRÁNY AND Z. FÜREDI, Computing the volume is difficult, in Proc. 18th ACM Symp. on Theory of Computing, ACM, New York, 1986, pp. 442-447. Reprinted in Discrete Comput. Geom., 2 (1987), pp. 319-326.
7. [Ba94] A.I. BARVINOK, A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed, Math. Oper. Res., 19 (1994), pp. 769-779.
8. [BZ65] I.S. BEREZIN AND N.P. ZHIDKOV, Computing Methods, Vol. 1, Pergamon Press, Oxford, 1965.
9. [Be75] D.N BERNSHTEIN, The number of roots of a system of equations, Funct. Anal. Appl., 9 (1975), pp. 183-185.
10. [Be92] U. BETKE, Mixed volumes of polytopes, Arch. Math., 58 (1992), pp. 388-391.
11. [BH93] U. BETKE AND M. HENK, Approximating the volume of convex bodies, Discrete Comput. Geom., 10 (1993), pp. 15-21.
12. [BF34] T. BONNESEN AND W. FENCHEL, Theorie der konvexen Körper, Springer-Verlag, Berlin, 1934 (in German); (reprinted: Chelsea, New York, 1948); Theory of Convex Bodies, BCS Associates, Moscow, Idaho, 1987, (in English).
13. [BF34] T. BONNESEN AND W. FENCHEL, Theorie der konvexen Körper, Springer-Verlag, Berlin, 1934 (in German); (reprinted: Chelsea, New York, 1948); Theory of Convex Bodies, BCS Associates, Moscow, Idaho, 1987, (in English).
14. [BW92] G. BRIGHTWELL AND P. WINKLER, Counting linear extensions is #P-complete, Order, 8 (1992), pp. 225-242.
15. [Br86] A. Z. BRODER, How hard is it to marry at random? (On the approximation of the permanent), in Proc. 18th ACM Symp. on Theory of Computing, ACM, New York, 1986, pp. 50-58.
16. [BS83] R. A. BRUALDI AND H. SCHNEIDER, Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley, Linear Algebra Appl., 52-53 (1983), pp. 769-791.
17. [BZ88] YU. D. BURAGO AND V. A. ZALGALLER, Geometric Inequalities, Springer-Verlag, Berlin, 1988.
18. [CE93] J. CANNY AND I.Z. EMIRIS, An efficient algorithm for the sparse mixed resultant, in Proc. 10th Intl. Symp. Appl. Algebra, Algebraic Alg., Error-Corr. Codes, Lecture Notes in Comput. Sci. 263, Springer-Verlag, New York, 1993, pp. 89-104.
19. [CR91] J. CANNY AND J.M. ROJAS, An optimality condition for determining the exact number of roots of a polynomial system, in Proc. ACM Intl. Symp. Algebraic Symbolic Comput., Bonn, Germany, ACM, New York, 1991, pp. 96-102.
20. [CH79] J. COHEN AND T. HICKEY, Two algorithms for determining volumes of convex polyhedra, J. Assoc. Comput. Mach., 26 (1979), pp. 401-414.
21. [CY77] K.C. CHUNG AND T.H. YAO, On lattices admitting unique Lagrange interpolation, SIAM J. Numer. Anal., 14 (1977), pp. 735-743.
22. [CKM82] R. CHANDRASEKARAN, S.N. KABADI, AND K.G. MURTY, Some NP-complete problems in linear programming, Oper. Res. Lett., 1 (1982), pp. 101-104.
23. [DF88] M.E. DYER AND A.M. FRIEZE, The complexity of computing the volume of a polyhedron, SIAM J. Comput., 17 (1988), pp. 967-974.
24. [DF91] M.E. DYER AND A.M. FRIEZE, Computing the volume of convex bodies: a case where randomness provably helps, in Probabilistic Combinatorics and its Applications, Proceedings of Symposia in Applied Mathematics, Vol. 44, Béla Bollobás, ed., American Mathematical Society, Providence, RI, 1991, pp. 123-169.
25. [DFK91] M.E. DYER, A.M. FRIEZE, AND R. KANNAN, A random polynomial time algorithm for approximating the volume of a convex body, J. Assoc. Comput. Mach., 38 (1991), pp. 1-17.
26. [DK97] M.E. DYER AND R. KANNAN, On Barvinok's algorithm for counting lattice points in fixed dimension, Math. Oper. Res., 22 (1997), to appear.
27. [Ed70] 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.
28. [Eh67] E. EHRHART, Sur un probléme de géometrie diophantienne linéaire, J. Reine Angew. Math., 226 (1967), pp. 1-29; 227 (1967), pp. 25-49.
29. [Eh67] E. EHRHART, Sur un probléme de géometrie diophantienne linéaire, J. Reine Angew. Math., 226 (1967), pp. 1-29; 227 (1967), pp. 25-49.
30. [Eh77] E. EHRHART, Polynômes arithmétiques et méthode des polyédres en combinatoire, Birkhäuser, Basel, 1977.
31. [EC95] I.Z. EMIRIS AND J.F. CANNY, Efficient incremental algorithms for the sparse resultant and the mixed volume, J. Symbolic Comput., 20 (1995), pp. 117-149.
32. [ER94] I.Z. EMIRIS AND A. REGE, Monomial bases and polynomial system solving, in Proc. 8th ACM Intl. Symp. Algebraic Symbolic Comput. '94, Oxford, UK, ACM, New York, 1994, pp. 114-122.
33. [Fe36] W. FENCHEL, Inégalités quadratique entre les volumes mixtes des corps convexes, C.R. Acad. Sci. Paris, 203 (1936), pp. 647-650.
34. [GJ79] M.R. GAREY AND D.S. JOHNSON, Computers and Intractability, W.H. Freeman, San Francisco, CA, 1979.
35. [GKZ90] I.M. GELFAND, M.M. KAPRANOV, AND A.V. ZELEVINSKY, Newton polytopes and the classical resultant and discriminant, Adv. Math., 84 (1990), pp. 237-254.
36. [GV89] D. GIRAD AND P. VALENTIN, Zonotopes and mixture management, in New Methods in Optimization and their Industrial Uses, J.P. Penot, ed., ISNM87, Birkhäuser, Basel, 1989, pp. 57-71.
37. [GK94] 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. Ivic Weiss, eds., Kluwer, Boston, 1994, pp. 373-466.
38. [GKL95] P. GRITZMANN, V. KLEE, AND D. LARMAN, Largest k-simplices in d-polytopes, Discrete Comput. Geom., 13 (1995), pp. 477-515.
39. [GS93] P. GRITZMANN AND B. STURMFELS, Minkowski addition of polytopes: computational complexity and applications to Gröbner bases, SIAM J. Discrete Math., 6 (1993), pp. 246-269.
40. [GW93] P. GRITZMANN AND J.M. WILLS, Lattice points, in Handbook of Convex Geometry, P.M. Gruber and J.M. Wills, eds., Elsevier, Amsterdam, 1993, pp. 765-798.
41. [GLS88] M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
42. [HS95] B. HUBER AND B. STURMFELS, A polyhedral method for solving sparse polynomial systems, Math. Comput., 64 (1995), pp. 1541-1555.
43. [JS89] M. R. JERRUM AND A. J. SINCLAIR, Approximating the permanent, SIAM J. Comput., 18 (1989), pp. 1149-1178.
44. [JVV86] M. R. JERRUM, L. G. VALIANT, AND V.V. VAZIRANI, Random generation of combinatorical structures from a uniform distribution, Theoret. Comput. Sci., 43 (1986), pp. 169-188.
45. [Jo90] D.S. JOHNSON, A catalog of complexity classes, in Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, J. van Leeuwen, ed., Elsevier and M.I.T. Press, Amsterdam and Cambridge, MA, 1990 , pp. 67-161.
46. 5) volume algorithm for convex bodies, Random Structures Algorithms, 11 (1997), pp. 1-96.
47. [KKLLL93] N. KARMARKAR, R. KARP, R. LIPTON, L. LOVÁSZ, AND M. LUBY, A Monte-Carlo algorithm for estimationg the permanent, SIAM J. Comput., 22 (1993), pp. 284-293.
48. [Kh93] L.G. KHACHIYAN, Complexity of polytope volume computation, in New Trends in Discrete and Computational Geometry, J. Pach, ed., Springer-Verlag, Berlin, 1993, pp. 91-101.
49. [KT93] L.G. KHACHIYAN AND M.J. TODD, On the complexity of approximating the maximal inscribed ellipsoid for a polytope, Math. Programming, 61 (1993), pp. 137-159.
50. [La91] J. LAWRENCE, Polytope volume computation, Math. Comput., 57 (1991), pp. 259-271.
51. [LRW96] T.Y. Li, J.M. ROJAS, AND X. WANG, Counting affine roots of polynomial systems via pointed Newton polytopes, J. Complexity, 12 (1996), pp. 116-133.
52. [Lo95] L. LOVÁSZ, Random walks on graphs: A survey, in Combinatorics: Paul Erdös is 80, Vol. 2, D. Miklós, V. T. Sós and T. Szönyi, eds., Bolyai Soc. Math. Stud. 2, János Bolyai Math. Soc., Budapest, 1995, pp. 353-397.
53. [LS90] L. LOVÁSZ AND M. SIMONIVITS, The mixing rate of Markov chains, an isoperimetric inequality and computing the volume, in Proc. IEEE 31st Annual Symp. Found. Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 364-355.
54. [LS93] L. LOVÁSZ AND M. SIMONIVITS, Random walks in a convex body and an improved volume algorithm, Random Structures Algorithms, 4 (1993), pp. 359-412.
55. [Mc70] P. MCMULLEN, The maximum number of faces of a convex polytope, Mathematika, 17 (1970), pp. 179-184.
56. [MM85] G. MIEL AND R. MOONEY, On the condition number of Lagrangian numerical differentiation, Appl. Math. Comput., 16 (1985), pp. 241-252.
57. [Mi11] H. MINKOWSKI, Theorie der konvexen Körper, insbesondere Begründung ihres Oberflächenbegriffs, in Collected Works Vol. II, Leipzig, Berlin, 1911, pp. 131-229.
58. [Mo89] H. L. MONTGOMERY, Computing the volume of a zonotope, Amer. Math. Monthly, 96 (1989), p. 431.
59. [Ol86] C. OLMSTED, Two formulas for the general multivariate polynomial which interpolates a regular grid on a simplex, Math. Comput., 47 (1986), pp. 275-284.
60. [PY90] C.H. PAPADIMITRIOU AND M. YANNAKAKIS, On recognizing integer polyhedra, Combinatorica, 10 (1990), pp. 107-109.
61. [PS93] P. PEDERSEN AND B. STURMFELS, Product formulas for sparse resultants, Math. Z., 214 (1993), pp. 377-396.
62. [Ri75] T.J. RIVLIN, Optimally stable Lagrangian numerical differentiation, SIAM J. Numer. Anal., 12 (1975), pp. 712-725.
63. [Ri90] T.J. RIVLIN, Chebyshev Polynomials. From Approximation Theory to Algebra and Number Theory, 2nd ed., John Wiley, New York, 1990.
64. [Ro94] J.M. ROJAS, A convex geometric approach to counting the roots of a polynomial system, Theoret. Comput. Sci., 133 (1994), pp. 105-140.
65. [Ro97] J.M. ROJAS, Toric intersection for affine root counting, J. Pure Appl. Math., 133 (1997), to appear.
66. [Sa74] H.E. SALZER, Some problems in optimally stable Lagrangian differentiation, Math. Comput., 28 (1974), pp. 1105-1115.
67. [Sa93] J.R. SANGWINE-YAGER, Mixed volumes, in Handbook of Convex Geometry, P.M. Gruber and J.M. Wills, eds., Elsevier, Amsterdam, 1993, pp. 43-72.
68. [Sc93] R. SCHNEIDER, Convex Bodies: The Brunn-Minkowski Theory, Encyclopedia of Mathematics and its Applications, Vol. 44, Cambridge University Press, Cambridge, MA, 1993.
69. [Sc94] R. SCHNEIDER, Polytopes and Brunn-Minkowski theory, in Polytopes: Abstract, Convex and Computational, T. Bisztriczky, P. McMullen, R. Schneider, and A. Ivic Weiss, eds., Kluwer, Boston, 1994, pp. 273-300.
70. [Sc86] A. SCHRIJVER, Linear and Integer Programming, Wiley-Interscience, New York, 1986.
71. [Sh74] G.C. SHEPHARD, Combinatorial properties of associated zonotopes, Canad. J. Math., 26 (1974), pp. 302-321.
72. [SJ89] A. SINCLAIR AND M. JERRUM, Approximate counting, uniform generation and rapidly mixing Markov chains, inform. Comput., 82 (1989), pp. 93-133.
73. [St81] R.M. STANLEY, Two combinatorial applications of the Aleksandrov-Fenchel inequalities, J. Combin. Theory Ser. A, 17 (1981), pp. 56-65.
74. [St86] R.M. STANLEY, Enumerative Combinatorics, Vol. 1, Wadsworth & Brooks/Cole, Pacific Grove, CA, 1986.
75. [St91] R. STANLEY, A zonotope associated with graphical degree sequences, in Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, P. Gritzmann and B. Sturmfels, eds., Amer. Math. Soc. and Assoc. Comput. Mach., Providence, RI, 1991, pp. 555-570.
76. [Va77] L.G. VALIANT, The complexity of computing the permanent, Theoret. Comput. Sci., 8 (1977), pp. 189-201.
77. [Va79] L.G. VALIANT, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979), pp. 410-421.
78. [VC92] J. VERSCHELDE AND R. COOLS, Nonlinear reduction for solving deficient polynomial systems by continuation methods, Numer. Math., 63 (1992), pp. 263-282.
79. [VG95] J. VERSCHELDE AND K. GATERMANN, Symmetric Newton polytopes for solving sparse polynomial systems, Adv. Appl. Math, 16 (1995), pp. 95-127.
80. [VVC94] J. VERSCHELDE, P. VERLINDEN, AND R. COOLS, Homotopies exploiting Newton polytopes for solving sparse polynomial systems, SIAM J. Numer. Anal., 31 (1994), pp. 915-930.
81. [We76] D.J.A. WELSH, Matroid Theory, Academic Press, London, 1976.
82. [Wh87] N. WHITE, Unimodular matroids, in Combinatorial Geometries, N. White, eds., Cambridge University Press, Cambridge, MA, 1987, pp. 40-52.