{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:42:22Z","timestamp":1725745342233},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_45","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T14:36:43Z","timestamp":1376663803000},"page":"504-515","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums"],"prefix":"10.1007","author":[{"given":"Leonid","family":"Gurvits","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1017\/CBO9781107325548.006","volume-title":"Surveys in Combinatorics (Southampton, 1983)","author":"A. Schrijver","year":"1983","unstructured":"Schrijver, A.: Bounds on permanents, and the number of 1-factors and 1-factorizations of bipartite graphs. In: Surveys in Combinatorics (Southampton, 1983). London Math. Soc. Lecture Note Ser., vol.\u00a082, pp. 107\u2013134. Cambridge Univ. Press, Cambridge (1983)"},{"key":"45_CR2","doi-asserted-by":"publisher","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. Journal of Combinatorial Theory, Series B\u00a072, 122\u2013135 (1998)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"10","key":"45_CR3","doi-asserted-by":"crossref","first-page":"903","DOI":"10.4169\/000298910x523380","volume":"117","author":"M. Laurent","year":"2010","unstructured":"Laurent, M., Schrijver, A.: On Leonid Gurvits\u2019 proof for permanents. Amer. Math. Monthly\u00a0117(10), 903\u2013911 (2010)","journal-title":"Amer. Math. Monthly"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Gurvits, L.: Van der Waerden\/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all. Electronic Journal of Combinatorics\u00a015 (2008)","DOI":"10.37236\/790"},{"issue":"4","key":"45_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s00454-009-9147-5","volume":"41","author":"L. Gurvits","year":"2009","unstructured":"Gurvits, L.: A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor. Discrete Comput. Geom.\u00a041(4), 533\u2013555 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"45_CR6","unstructured":"Gurvits, L.: Combinatorial and algorithmic aspects of hyperbolic polynomials (2004), http:\/\/xxx.lanl.gov\/abs\/math.CO\/0404474"},{"key":"45_CR7","unstructured":"Gurvits, L.: Unleashing the power of Schrijver\u2019s permanental inequality with the help of the Bethe Approximation (2011), http:\/\/arxiv.org\/abs\/1106.2844"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-03562-3_4","volume-title":"Advances in Combinatorial Mathematics","author":"L. Gurvits","year":"2009","unstructured":"Gurvits, L.: On multivariate Newton-like inequalities. In: Advances in Combinatorial Mathematics, pp. 61\u201378. Springer, Berlin (2009), http:\/\/arxiv.org\/pdf\/0812.3687v3.pdf"},{"key":"45_CR9","doi-asserted-by":"publisher","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. Advances in Math.\u00a042, 299\u2013305 (1981)","journal-title":"Advances in Math."},{"issue":"6","key":"45_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\u00a029(6), 931\u2013938, 957 (1981) (in Russian)","journal-title":"Mat. Zametki"},{"key":"45_CR11","first-page":"417","volume-title":"Proc. 38 ACM Symp. on Theory of Computing (StOC 2006)","author":"L. Gurvits","year":"2006","unstructured":"Gurvits, L.: Hyperbolic polynomials approach to Van der Waerden\/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications. In: Proc. 38 ACM Symp. on Theory of Computing (StOC 2006), pp. 417\u2013426. ACM, New York (2006)"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcta.2005.03.005","volume":"113","author":"C. Greenhill","year":"2006","unstructured":"Greenhill, C., McKay, B.D., Wang, X.: Asymptotic enumeration of sparse 0-1 ma- trices with irregular row and column sums. Journal of Combinatorial Theory. Series A\u00a0113, 291\u2013324 (2006)","journal-title":"Journal of Combinatorial Theory. Series A"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1002\/rsa.20273","volume":"35","author":"C. Greenhill","year":"2009","unstructured":"Greenhill, C., McKay, B.D.: Random dense bipartite graphs and directed graphs with specified degrees. Random Structures and Algorithms\u00a035, 222\u2013249 (2009)","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"45_CR14","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.aim.2009.12.001","volume":"224","author":"A. Barvinok","year":"2010","unstructured":"Barvinok, A.: On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries. Adv. Math.\u00a0224(1), 316\u2013339 (2010)","journal-title":"Adv. Math."},{"issue":"1","key":"45_CR15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(71)90007-0","volume":"1","author":"C.J. Everett","year":"1971","unstructured":"Everett, C.J., Stein, P.R.: The asymptotic number of integer stochastic matrices. Discrete Math.\u00a01(1), 55\u201372 (1971\/1972)","journal-title":"Discrete Math."},{"key":"45_CR16","first-page":"225","volume-title":"Enumeration and Design","author":"B.D. McKay","year":"1984","unstructured":"McKay, B.D.: Asymptotics for 0-1 matrices with prescribed line sums. In: Enumeration and Design, pp. 225\u2013238. Academic Press, Canada (1984)"},{"key":"45_CR17","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"W.T. Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor theorem for finite graphs. Canad. J. Math.\u00a06, 347\u2013352 (1954)","journal-title":"Canad. J. Math."},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Vishnoi, N.K.: A Permanent Approach to the Traveling Salesman Problem. In: FOCS 2012, pp. 76\u201380 (2012)","DOI":"10.1109\/FOCS.2012.81"},{"key":"45_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM\u00a051, 671\u2013697 (2004)","journal-title":"Journal of the ACM"},{"issue":"2","key":"45_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF03008959","volume":"2","author":"S.G. Hwang","year":"1995","unstructured":"Hwang, S.G.: Matrix Polytope and Speech Security Systems. Korean J. CAM.\u00a02(2), 3\u201312 (1995)","journal-title":"Korean J. CAM."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T03:23:26Z","timestamp":1596338606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}