{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:17:10Z","timestamp":1768270630463,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,2,26]],"date-time":"2009-02-26T00:00:00Z","timestamp":1235606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s00454-009-9147-5","type":"journal-article","created":{"date-parts":[[2009,2,25]],"date-time":"2009-02-25T16:28:42Z","timestamp":1235579322000},"page":"533-555","source":"Crossref","is-referenced-by-count":13,"title":["A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor"],"prefix":"10.1007","volume":"41","author":[{"given":"Leonid","family":"Gurvits","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,26]]},"reference":[{"key":"9147_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02187886","volume":"2","author":"I. B\u00e1r\u00e1ny","year":"1987","unstructured":"B\u00e1r\u00e1ny, I., F\u00fcredi, Z.: Computing the volume is difficult. Discrete Comput. Geom. 2, 319\u2013326 (1987)","journal-title":"Discrete Comput. Geom."},{"key":"9147_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/PL00009316","volume":"18","author":"A.I. Barvinok","year":"1997","unstructured":"Barvinok, A.I.: Computing mixed discriminants, mixed volumes, and permanents. Discrete Comput. Geom. 18, 205\u2013237 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"9147_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0024-3795(89)90009-8","volume":"126","author":"R.B. Bapat","year":"1989","unstructured":"Bapat, R.B.: Mixed discriminants of positive semidefinite matrices. Linear Algebra Appl. 126, 107\u2013124 (1989)","journal-title":"Linear Algebra Appl."},{"key":"9147_CR4","doi-asserted-by":"crossref","unstructured":"Belkin, M., Narayanan, H., Niyogi, P.: Heat flow and a faster algorithm to compute the surface area of a convex body. In: FOCS 2006 (2006)","DOI":"10.1109\/FOCS.2006.34"},{"key":"9147_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07441-1","volume-title":"Geometric Inequalities","author":"Yu.D. Burago","year":"1988","unstructured":"Burago, Yu.D., Zalgaller, V.A.: Geometric Inequalities. Springer, Berlin (1988)"},{"key":"9147_CR6","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1137\/0217060","volume":"17","author":"M. Dyer","year":"1988","unstructured":"Dyer, M., Frieze, A.: The complexity of computing the volume of a polyhedron. SIAM J. Comput. 17, 967\u2013994 (1988)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9147_CR7","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1137\/S0097539794278384","volume":"27","author":"M. Dyer","year":"1998","unstructured":"Dyer, M., Gritzmann, P., Hufnagel, A.: On the complexity of computing mixed volumes. SIAM J. Comput. 27(2), 356\u2013400 (1998)","journal-title":"SIAM J. Comput."},{"key":"9147_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0001-8708(81)90044-X","volume":"42","author":"G.P. Egorychev","year":"1981","unstructured":"Egorychev, G.P.: The solution of van der Waerden\u2019s problem for permanents. Adv. Math. 42, 299\u2013305 (1981)","journal-title":"Adv. Math."},{"key":"9147_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jsco.1995.1041","volume":"20","author":"I.Z. Emiris","year":"1995","unstructured":"Emiris, I.Z., Canny, J.F.: Efficient incremental algorithms for sparse resultant and the mixed volume. J. Symb. Comput. 20, 117\u2013149 (1995)","journal-title":"J. Symb. Comput."},{"issue":"6","key":"9147_CR10","first-page":"931","volume":"29","author":"D.I. Falikman","year":"1981","unstructured":"Falikman, D.I.: Proof of the van der Waerden\u2019s conjecture on the permanent of a doubly stochastic matrix. Mat. Zametki 29(6), 931\u2013938 (1981). (In Russian)","journal-title":"Mat. Zametki"},{"issue":"4","key":"9147_CR11","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/1114268.1114274","volume":"31","author":"T. Gao","year":"2005","unstructured":"Gao, T., Li, T.Y., Wu, M.: MixedVol: A software package for Mixed Volume computation. ACM Trans. Math. Softw. 31(4), 555\u2013560 (2005)","journal-title":"ACM Trans. Math. Softw."},{"key":"9147_CR12","doi-asserted-by":"crossref","unstructured":"Gurvits, L., Samorodnitsky, A.: A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume. In: Proc. 32 ACM Symp. on Theory of Computing, pp. 48\u201357, pp.\u00a0417\u2013426. ACM, New York (2000)","DOI":"10.1145\/335305.335311"},{"key":"9147_CR13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s00454-001-0083-2","volume":"27","author":"L. Gurvits","year":"2002","unstructured":"Gurvits, L., Samorodnitsky, A.: A deterministic algorithm approximating the mixed discriminant and mixed volume, and a combinatorial corollary. Discrete Comput. Geom. 27, 531\u2013550 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"9147_CR14","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.aim.2004.12.002","volume":"200","author":"L. Gurvits","year":"2006","unstructured":"Gurvits, L.: Van der Waerden conjecture for mixed discriminants. Adv. Math. 200, 435\u2013454 (2006)","journal-title":"Adv. Math."},{"key":"9147_CR15","doi-asserted-by":"crossref","unstructured":"Gurvits, L.: Hyperbolic polynomials approach to Van der Waerden\/Schrijver\u2013Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications. In: Proc. of STOC-2006 (2006)","DOI":"10.1145\/1132516.1132578"},{"key":"9147_CR16","unstructured":"Gurvits, L.: A proof of hyperbolic van der Waerden conjecture: the right generalization is the ultimate simplification. Electron. Colloq. Comput. Complex. (ECCC)(103) (2008). arXiv:math\/0504397"},{"key":"9147_CR17","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1090\/S0025-5718-1995-1297471-4","volume":"64","author":"B. Huber","year":"1995","unstructured":"Huber, B., Sturmfels, B.: A polyhedral method for solving sparse polynomial systems. Math. Comput. 64, 1541\u20131555 (1995)","journal-title":"Math. Comput."},{"issue":"4","key":"9147_CR18","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s004930070007","volume":"20","author":"N. Linial","year":"2000","unstructured":"Linial, N., Samorodnitsky, A., Wigderson, A.: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. Combinatorica 20(4), 545\u2013568 (2000)","journal-title":"Combinatorica"},{"key":"9147_CR19","unstructured":"Lov\u00e1sz, L., Vempala, S.: Simulating annealing in convex bodies and an O *(n 4) volume algorithm. In: Proc. of FOCS-2003, Boston (2003)"},{"key":"9147_CR20","volume-title":"Permanents","author":"H. Minc","year":"1978","unstructured":"Minc, H.: Permanents. Addison-Wesley, Reading (1978)"},{"key":"9147_CR21","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A.S. Nemirovsky","year":"1979","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Nauka, Moscow (1979). (In Russian); English translation: Wiley (1984)"},{"key":"9147_CR22","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0024-3795(99)00212-8","volume":"302\/303","author":"A. Nemirovski","year":"1999","unstructured":"Nemirovski, A., Rothblum, U.: On complexity of matrix scaling. Linear Algebra Appl. 302\/303, 435\u2013460 (1999)","journal-title":"Linear Algebra Appl."},{"issue":"10","key":"9147_CR23","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1080\/00029890.1998.12004987","volume":"105","author":"B. Sturmfels","year":"1998","unstructured":"Sturmfels, B.: Polynomial equations and convex polytopes. Am. Math. Mon. 105(10), 907\u2013922 (1998)","journal-title":"Am. Math. Mon."},{"key":"9147_CR24","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/1385-7258(80)90043-8","volume":"42","author":"A. Schrijver","year":"1980","unstructured":"Schrijver, A., Valiant, W.G.: On lower bounds for permanents. Indag. Math. 42, 425\u2013427 (1980)","journal-title":"Indag. Math."},{"key":"9147_CR25","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1006\/jctb.1997.1798","volume":"72","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Counting 1-factors in regular bipartite graphs. J. Comb. Theory, Ser. B 72, 122\u2013135 (1998)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9147_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1112\/S0025579300001674","volume":"7","author":"G.C. Shephard","year":"1960","unstructured":"Shephard, G.C.: Inequalities between mixed volumes of convex sets. Mathematika 7, 125\u2013138 (1960)","journal-title":"Mathematika"},{"key":"9147_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/1385-7258(79)90012-X","volume":"41","author":"M. Voorhoeve","year":"1979","unstructured":"Voorhoeve, M.: A lower bound for the permanents of certain (0,1) matrices. Indag. Math. 41, 83\u201386 (1979)","journal-title":"Indag. Math."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9147-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-009-9147-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9147-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:36Z","timestamp":1559087256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-009-9147-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,26]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9147"],"URL":"https:\/\/doi.org\/10.1007\/s00454-009-9147-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,26]]}}}