{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:16Z","timestamp":1781078236583,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T00:00:00Z","timestamp":1420502400000},"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":[[2016,4]]},"DOI":"10.1007\/s10208-014-9243-7","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T13:44:38Z","timestamp":1420465478000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["Computing the Permanent of (Some) Complex Matrices"],"prefix":"10.1007","volume":"16","author":[{"given":"Alexander","family":"Barvinok","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,1,6]]},"reference":[{"key":"9243_CR1","doi-asserted-by":"crossref","unstructured":"S. Aaronson and A. Arkhipov, The computational complexity of linear optics, Theory of Computing 9 (2013), 143\u2013252.","DOI":"10.4086\/toc.2013.v009a004"},{"key":"9243_CR2","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A.Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation.Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag, Berlin 1999.","DOI":"10.1007\/978-3-642-58412-1"},{"issue":"1","key":"9243_CR3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/moor.21.1.65","volume":"21","author":"A Barvinok","year":"1996","unstructured":"A. Barvinok, Two algorithmic results for the traveling salesman problem, Mathematics of Operations Research 21 (1996), no. 1, 65\u201384.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"9243_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/(SICI)1098-2418(1999010)14:1<29::AID-RSA2>3.0.CO;2-X","volume":"14","author":"A Barvinok","year":"1999","unstructured":"A. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures & Algorithms 14 (1999), no. 1, 29\u201361.","journal-title":"Random Structures & Algorithms"},{"key":"9243_CR5","unstructured":"A. Barvinok, Computing the partition function for cliques in a graph, preprint arXiv:1405.1974 (2014)."},{"issue":"6","key":"9243_CR6","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1017\/S0963548311000435","volume":"20","author":"A Barvinok","year":"2011","unstructured":"A. Barvinok and A. Samorodnitsky, Computing the partition function for perfect matchings in a hypergraph, Combinatorics, Probability and Computing 20 (2011), no. 6, 815\u2013835.","journal-title":"Combinatorics, Probability and Computing"},{"key":"9243_CR7","unstructured":"A. Barvinok and P. Sober\u00f3n, Computing the partition function for graph homomorphisms, preprint arXiv:1406.1771 (2014)."},{"key":"9243_CR8","doi-asserted-by":"crossref","unstructured":"J. Draisma, E. Horobet, G. Ottaviani, B. Sturmfels and R.R. Thomas, The Euclidean distance degree of an algebraic variety, preprint arXiv:1309.0049 (2013).","DOI":"10.1145\/2631948.2631951"},{"key":"9243_CR9","unstructured":"S. Friedland and L. Gurvits, Generalized Friedland-Tverberg inequality: applications and extensions, preprint arXiv:0603410 (2006)."},{"key":"9243_CR10","doi-asserted-by":"crossref","unstructured":"M. F\u00fcrer, Approximating permanents of complex matrices, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, ACM, New York 2000, pp. 667\u2013669.","DOI":"10.1145\/335305.335399"},{"issue":"8","key":"9243_CR11","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.jcss.2010.05.002","volume":"76","author":"D Gamarnik","year":"2010","unstructured":"D. Gamarnik and D. Katz, A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix, Journal of Computer and System Sciences 76 (2010), no. 8, 879\u2013883.","journal-title":"Journal of Computer and System Sciences"},{"key":"9243_CR12","doi-asserted-by":"crossref","unstructured":"L. Gurvits, On the complexity of mixed discriminants and related problems, Mathematical Foundations of Computer Science 2005, Lecture Notes in Computer Science, vol. 3618, Springer, Berlin, 2005, pp. 447\u2013458.","DOI":"10.1007\/11549345_39"},{"key":"9243_CR13","doi-asserted-by":"crossref","unstructured":"L. Gurvits and A. Samorodnitsky, Bounds on the permanent and some applications, preprint arXiv:1408.0976 (2014).","DOI":"10.1109\/FOCS.2014.18"},{"issue":"4","key":"9243_CR14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M Jerrum","year":"2004","unstructured":"M. Jerrum, A. Sinclair and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, Journal of the ACM 51 (2004), no. 4, 671\u2013697.","journal-title":"Journal of the ACM"},{"issue":"4","key":"9243_CR15","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s004930070007","volume":"20","author":"N Linial","year":"2000","unstructured":"N. Linial, A. Samorodnitsky, and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Combinatorica 20 (2000), no. 4, 545\u2013568.","journal-title":"Combinatorica"},{"key":"9243_CR16","volume-title":"Permanents. Encyclopedia of Mathematics and its Applications, Vol. 6","author":"H Minc","year":"1978","unstructured":"H. Minc, Permanents. Encyclopedia of Mathematics and its Applications, Vol. 6, Addison-Wesley Publishing Co., Reading, Mass., 1978."},{"issue":"5\u20136","key":"9243_CR17","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1007\/s10955-004-2055-4","volume":"118","author":"AD Scott","year":"2005","unstructured":"A.D. Scott and A.D. Sokal, The repulsive lattice gas, the independent-set polynomial, and the Lov\u00e1sz local lemma, Journal of Statistical Physics 118 (2005), no. 5\u20136, 1151\u20131261.","journal-title":"Journal of Statistical Physics"},{"issue":"2","key":"9243_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"L.G. Valiant, The complexity of computing the permanent, Theoretical Computer Science 8 (1979), no. 2, 189\u2013201.","journal-title":"Theoretical Computer Science"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-014-9243-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-014-9243-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-014-9243-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T03:28:04Z","timestamp":1566185284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-014-9243-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9243"],"URL":"https:\/\/doi.org\/10.1007\/s10208-014-9243-7","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,6]]}}}