{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:42:18Z","timestamp":1735882938040,"version":"3.32.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1007\/bf01940871","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T10:46:47Z","timestamp":1122806807000},"page":"392-401","source":"Crossref","is-referenced-by-count":15,"title":["A mildly exponential approximation algorithm for the permanent"],"prefix":"10.1007","volume":"16","author":[{"given":"M.","family":"Jerrum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Vazirani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01940871_CR1","doi-asserted-by":"crossref","unstructured":"A. Z. Broder, How hard is it to marry at random? (On the approximation of the permanent),Proceedings of the 18th ACM Symposium on Theory of Computing, 1986, pp. 50\u201358. Erratum,Proceedings of the 20th ACM Symposium on Theory of Computing, 1988, p. 551.","DOI":"10.1145\/12130.12136"},{"key":"BF01940871_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01294460","volume":"15","author":"A. Frieze","year":"1995","unstructured":"A. Frieze and M. Jerrum, An analysis of a Monte Carlo algorithm for estimating the permanent,Combinatorica,15 (1995), 67\u201383.","journal-title":"Combinatorica"},{"key":"BF01940871_CR3","series-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai, Vol. 25","first-page":"241","volume-title":"Algebraic Methods in Graph Theory, I","author":"C. D. Godsil","year":"1981","unstructured":"C. D. Godsil and I. Gutman, On the matching polynomial of a graph,Algebraic Methods in Graph Theory, I (L. Lov\u00e1sz and V. T. S\u00f3s, editors), Colloquia Mathematica Societatis J\u00e1nos Bolyai, Vol. 25, North-Holland, Amsterdam, 1981, pp. 241\u2013249."},{"key":"BF01940871_CR4","unstructured":"M. Jerrum, An analysis of a Monte Carlo algorithm for estimating the permanent,Proceedings of the 3rd Conference on Integer Programming and Combinatorial Optimization, CORE, Louvain-la-Neuve, Belgium, April 1993, pp. 171\u2013182."},{"key":"BF01940871_CR5","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"M. Jerrum and A. Sinclair, Approximating the permanent,SIAM Journal on Computing,18 (1989), 1149\u20131178.","journal-title":"SIAM Journal on Computing"},{"key":"BF01940871_CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M. R. Jerrum","year":"1986","unstructured":"M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution,Theoretical Computer Science,43 (1986), 169\u2013188.","journal-title":"Theoretical Computer Science"},{"key":"BF01940871_CR7","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1137\/0222021","volume":"22","author":"N. Karmarkar","year":"1993","unstructured":"N. Karmarkar, R. Karp, R. Lipton, L. Lov\u00e1sz, and M. Luby, A Monte-Carlo algorithm for estimating the permanent.SIAM Journal on Computing,22 (1993), 284\u2013293.","journal-title":"SIAM Journal on Computing"},{"key":"BF01940871_CR8","doi-asserted-by":"crossref","unstructured":"R. M. Karp and M. Luby, Monte Carlo algorithms for enumeration and reliability problems,Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 56\u201364.","DOI":"10.1109\/SFCS.1983.35"},{"key":"BF01940871_CR9","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. D. Plummer,Matching Theory, North-Holland, Amsterdam, 1986."},{"key":"BF01940871_CR10","volume-title":"Permanents","author":"H. Minc","year":"1978","unstructured":"H. Minc,Permanents, Addison-Wesley, Reading, MA, 1978."},{"key":"BF01940871_CR11","unstructured":"A. Sinclair,Randomised Algorithms for Counting and Generating Combinatorial Structures, Ph.D. Thesis, University of Edinburgh, June 1988."},{"key":"BF01940871_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation and Counting: a Markov Chain Approach","author":"A. Sinclair","year":"1993","unstructured":"A. Sinclair,Algorithms for Random Generation and Counting: a Markov Chain Approach, Birkh\u00e4user, Boston, 1993."},{"key":"BF01940871_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"L. G. Valiant, The complexity of computing the permanent,Theoretical Computer Science,8 (1979), 189\u2013201.","journal-title":"Theoretical Computer Science"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940871.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01940871\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T21:22:45Z","timestamp":1735852965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01940871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":13,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["BF01940871"],"URL":"https:\/\/doi.org\/10.1007\/bf01940871","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}