{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:51:05Z","timestamp":1776869465918,"version":"3.51.2"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T00:00:00Z","timestamp":1462492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10208-016-9320-1","type":"journal-article","created":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T18:25:33Z","timestamp":1462559133000},"page":"1293-1334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Computing Mixed Volume and All Mixed Cells in Quermassintegral Time"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8456-3959","authenticated-orcid":false,"given":"Gregorio","family":"Malajovich","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,6]]},"reference":[{"issue":"2","key":"9320_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/PL00009316","volume":"18","author":"A Barvinok","year":"1997","unstructured":"Barvinok, A. 1997. Computing mixed discriminants, mixed volumes, and permanents, Discrete Comput. Geom. 18, no. 2, 205-237, doi: 10.1007\/PL00009316 .","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9320_CR2","first-page":"1","volume":"9","author":"DN Bernstein","year":"1975","unstructured":"Bernstein, D. N. 1975. The number of roots of a system of equations, Funkcional. Anal. i Prilo\u017een. 9, no. 3, 1-4 (Russian).","journal-title":"Funkcional. Anal. i Prilo\u017een."},{"issue":"189","key":"9320_CR3","first-page":"201","volume":"3","author":"DN Bernstein","year":"1976","unstructured":"Bernstein, D. N., A. G. Ku\u0161nirenko, and A. G. Hovansk\u012d. 1976. Newton polyhedra, Uspehi Mat. Nauk 31, no. 3(189), 201-202 (Russian).","journal-title":"Uspehi Mat. Nauk 31"},{"issue":"1","key":"9320_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.11650\/tjm.18.2014.3276","volume":"18","author":"Tianran Chen","year":"2014","unstructured":"Chen, Tianran, Tsung-Lin Lee, and Tien-Yien Li. 2014. Mixed volume computation in parallel, Taiwanese J. Math. 18, no. 1, 93-114, doi: 10.11650\/tjm.18.2014.3276 .","journal-title":"Taiwanese J. Math."},{"issue":"5","key":"9320_CR5","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.4310\/MRL.2012.v19.n5.a10","volume":"19","author":"Dustin Cartwright","year":"2012","unstructured":"Cartwright, Dustin and Sam Payne. 2012. Connectivity of tropicalizations, Math. Res. Lett. 19, no. 5, 1089-1095, doi: 10.4310\/MRL.2012.v19.n5.a10 .","journal-title":"Math. Res. Lett."},{"key":"9320_CR6","doi-asserted-by":"crossref","unstructured":"Demmel, James W. 1997. Applied numerical linear algebra, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.","DOI":"10.1137\/1.9781611971446"},{"issue":"2","key":"9320_CR7","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1137\/S0097539794278384","volume":"27","author":"Martin Dyer","year":"1998","unstructured":"Dyer, Martin, Peter Gritzmann, and Alexander Hufnagel. 1998. On the complexity of computing mixed volumes, SIAM J. Comput. 27, no. 2, 356-400, doi: 10.1137\/S0097539794278384 .","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9320_CR8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1006\/jcom.1996.0010","volume":"12","author":"Ioannis Z Emiris","year":"1996","unstructured":"Emiris, Ioannis Z. 1996. On the complexity of sparse elimination, J. Complexity 12, no. 2, 134- 166, doi: 10.1006\/jcom.1996.0010 .","journal-title":"J. Complexity"},{"issue":"2","key":"9320_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/jsco.1995.1041","volume":"20","author":"Ioannis Z Emiris","year":"1995","unstructured":"Emiris, Ioannis Z. and John F. Canny. 1995. Efficient incremental algorithms for the sparse resul- tant and the mixed volume, J. Symbolic Comput. 20, no. 2, 117-149, doi: 10.1006\/jsco.1995.1041 .","journal-title":"J. Symbolic Comput."},{"key":"9320_CR10","doi-asserted-by":"crossref","unstructured":"Emiris, Ioannis Z. and Vissarion Fisikopoulos. 2014. Efficient Random-Walk Methods for Ap- proximating Polytope Volume, 30th Annual Symposium on Computational Geometry, SOCG\u201914, Kyoto, Japan, June 08 - 11, 2014, pp. 318.","DOI":"10.1145\/2582112.2582133"},{"key":"9320_CR11","doi-asserted-by":"crossref","unstructured":"Emiris, Ioannis Z. and Raimundas Vidunas. 2014. Root counts of semi-mixed systems, and an application to counting Nash equilibria, ISSAC\u201914, pp. 154-161.","DOI":"10.1145\/2608628.2608679"},{"issue":"4","key":"9320_CR12","doi-asserted-by":"crossref","first-page":"599","DOI":"10.11650\/twjm\/1500407294","volume":"4","author":"Tangan Gao","year":"2000","unstructured":"Gao, Tangan and T. Y. Li. 2000. Mixed volume computation via linear programming, Taiwanese J. Math. 4, no. 4, 599-619.","journal-title":"Taiwanese J. Math."},{"issue":"4","key":"9320_CR13","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/1114268.1114274","volume":"31","author":"Tangan Gao","year":"2005","unstructured":"Gao, Tangan, T. Y. Li, and Mengnien Wu. 2005. Algorithm 846: MixedVol: a software pack- age for mixed-volume computation, ACM Trans. Math. Software 31, no. 4, 555-560, doi: 10.1145\/1114268.1114274 .","journal-title":"ACM Trans. Math. Software"},{"issue":"4","key":"9320_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s00454-009-9147-5","volume":"41","author":"Leonid Gurvits","year":"2009","unstructured":"Gurvits, Leonid. 2009. A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor, Discrete Comput. Geom. 41, no. 4, 533-555, doi: 10.1007\/s00454-009-9147-5 .","journal-title":"Discrete Comput. Geom."},{"issue":"212","key":"9320_CR15","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.2307\/2153370","volume":"64","author":"Birkett Huber","year":"1995","unstructured":"Huber, Birkett and Bernd Sturmfels. 1995. A polyhedral method for solving sparse polynomial systems, Math. Comp. 64, no. 212, 1541-1555, doi: 10.2307\/2153370 .","journal-title":"Math. Comp."},{"key":"9320_CR16","unstructured":"Jensen, Anders. 2016. Tropical Homotopy Continuation, available at http:\/\/arxiv.org\/abs\/1601.02818 ."},{"key":"9320_CR17","doi-asserted-by":"publisher","unstructured":"Khachiyan, L. G. 1989. The problem of calculating the volume of a polyhedron is enumeratively hard, Uspekhi Mat. Nauk 44, no. 3(267), 179-180, doi: 10.1070\/RM1989v044n03ABEH002136 (Russian); English transl.,. 1989, Russian Math. Surveys 44, no. 3, 199-200.","DOI":"10.1070\/RM1989v044n03ABEH002136"},{"key":"9320_CR18","volume-title":"The art of computer programming","author":"Donald E Knuth","year":"1998","unstructured":"Knuth, Donald E. 1998. The art of computer programming. Vol. 3, Addison-Wesley, Reading, MA."},{"key":"9320_CR19","doi-asserted-by":"crossref","unstructured":"Le Gall, Fran\u00e7ois. 2014. Powers of Tensors and Fast Matrix Multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), pp. 296- 303.","DOI":"10.1145\/2608628.2608664"},{"key":"9320_CR20","doi-asserted-by":"publisher","unstructured":"Lee, Tsung-Lin and Tien-Yien Li. 2011. Mixed volume computation in solving polynomial system- s, Randomization, relaxation, and complexity in polynomial equation solving, Contemp. Math., vol. 556, Amer. Math. Soc., Providence, RI, pp. 97-112, doi: 10.1090\/conm\/556\/11009 , (to appear in print).","DOI":"10.1090\/conm\/556\/11009"},{"issue":"2","key":"9320_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s102080010005","volume":"1","author":"TY Li","year":"2001","unstructured":"Li, T. Y. and Xing Li. 2001. Finding mixed cells in the mixed volume computation, Found. Comput. Math. 1, no. 2, 161-181, doi: 10.1007\/s102080010005 .","journal-title":"Found. Comput. Math."},{"key":"9320_CR22","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/161","volume-title":"Introduction to Tropical Geometry","author":"Diane Maclagan","year":"2015","unstructured":"Maclagan, Diane and Bernd Sturmfels. 2015. Introduction to Tropical Geometry, American Mathematical Society, Providence, RI."},{"issue":"6","key":"9320_CR23","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1007\/s10208-013-9171-y","volume":"13","author":"Gregorio Malajovich","year":"2013","unstructured":"Malajovich, Gregorio. 2013. On the Expected Number of Zeros of Nonlinear Equations, Found. Comput. Math. 13, no. 6, 867-884, doi: 10.1007\/s10208-013-9171-y .","journal-title":"Found. Comput. Math."},{"issue":"2\u20133","key":"9320_CR24","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.tcs.2004.01.006","volume":"315","author":"Gregorio Malajovich","year":"2004","unstructured":"Malajovich, Gregorio and J. Maurice Rojas. 2004. High probability analysis of the condition number of sparse polynomial systems, Theoret. Comput. Sci. 315, no. 2-3, 524-555, doi: 10.1016\/j.tcs.2004.01.006 .","journal-title":"Theoret. Comput. Sci."},{"key":"9320_CR25","first-page":"21","volume":"132","author":"Hermann Minkowski","year":"1901","unstructured":"Minkowski, Hermann. 1901. Sur les surfaces convexes ferm\u00e9es, C.R. Acad.Sci., Paris 132, 21-24.","journal-title":"C.R. Acad. Sci. Paris"},{"key":"9320_CR26","doi-asserted-by":"publisher","unstructured":"Mizutani, Tomohiko and Akiko Takeda. 2008. DEMiCs: a software package for computing the mixed volume via dynamic enumeration of all mixed cells, Software for algebraic geometry, IMA Vol. Math. Appl., vol. 148, Springer, New York, pp. 59-79, doi: 10.1007\/978-0-387-78133-4 , (to appear in print).","DOI":"10.1007\/978-0-387-78133-4"},{"issue":"3","key":"9320_CR27","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00454-006-1300-9","volume":"37","author":"Tomohiko Mizutani","year":"2007","unstructured":"Mizutani, Tomohiko, Akiko Takeda, and Masakazu Kojima. 2007. Dynamic enumeration of all mixed cells, Discrete Comput. Geom. 37, no. 3, 351-367, doi: 10.1007\/s00454-006-1300-9 .","journal-title":"Discrete Comput. Geom."},{"key":"9320_CR28","volume-title":"Solving polynomial systems using continuation for engineering and scientific problems","author":"Alexander Morgan","year":"1987","unstructured":"Morgan, Alexander. 1987. Solving polynomial systems using continuation for engineering and scientific problems, Prentice Hall, Inc., Englewood Cliffs, NJ."},{"key":"9320_CR29","doi-asserted-by":"crossref","unstructured":"Preparata, Franco P. and Michael Ian Shamos. 1985. Computational geometry, Texts and Monographs in Computer Science, Springer-Verlag, New York. An introduction.","DOI":"10.1007\/978-1-4612-1098-6_1"},{"issue":"1","key":"9320_CR30","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1214\/11-AOS957","volume":"40","author":"Caroline Uhler","year":"2012","unstructured":"Uhler, Caroline. 2012. Geometry of maximum likelihood estimation in Gaussian graphical models, Ann. Statist. 40, no. 1, 238-261, doi: 10.1214\/11-AOS957 .","journal-title":"Ann. Statist."},{"key":"9320_CR31","unstructured":"Vassilevska Williams, Virginia. 2012. Multiplying matrices faster than Coppersmith-Winograd, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pp. 887-898."},{"issue":"2","key":"9320_CR32","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/317275.317286","volume":"25","author":"Verschelde","year":"1999","unstructured":"Verschelde, Jan. 1999. Algorithm 795: PHCPack: A general-purpose solver for polynomial sys- tems by homotopy continuation, ACM Transactions on Mathematical Software 25, no. 2, 251-276.","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"1","key":"9320_CR33","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF02711134","volume":"16","author":"J Verschelde","year":"1996","unstructured":"Verschelde, J., K. Gatermann, and R. Cools. 1996. Mixed-volume computation by dynamic lift- ing applied to polynomial system solving, Discrete Comput. Geom. 16, no. 1, 69-112, doi: 10.1007\/BF02711134 .","journal-title":"Discrete Comput. Geom."},{"key":"9320_CR34","unstructured":"Yu, Josephine. 2015. Do most polynomials generate a prime ideal?, available at http:\/\/arxiv.org\/abs\/1509.02050 ."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-016-9320-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9320-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9320-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9320-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T07:31:38Z","timestamp":1655710298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-016-9320-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,6]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9320"],"URL":"https:\/\/doi.org\/10.1007\/s10208-016-9320-1","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,6]]}}}