{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T21:10:02Z","timestamp":1736457002259,"version":"3.32.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01294460","type":"journal-article","created":{"date-parts":[[2006,7,7]],"date-time":"2006-07-07T22:43:44Z","timestamp":1152312224000},"page":"67-83","source":"Crossref","is-referenced-by-count":19,"title":["An analysis of a Monte Carlo algorithm for estimating the permanent"],"prefix":"10.1007","volume":"15","author":[{"given":"Alan","family":"Frieze","sequence":"first","affiliation":[]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01294460_CR1","unstructured":"B\u00e9la Bollob\u00e1s:Random Graphs, Academic Press, 1985."},{"key":"BF01294460_CR2","doi-asserted-by":"crossref","unstructured":"Andrei 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, 50\u201358. Erratum inProceedings of the 20th ACM Symposium on Theory of Computing, 1988, 551.","DOI":"10.1145\/12130.12136"},{"key":"BF01294460_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac:Some theorems on abstract graphs, Proceedings of the London Mathematical Society2 (1952) 69\u201381.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"BF01294460_CR4","unstructured":"Martin Dyer, Alan Frieze, andMark Jerrum: Approximately counting Hamilton cycles in dense graphs,Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1994, 336\u2013343."},{"key":"BF01294460_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/rsa.3240030303","volume":"3","author":"Alan Frieze","year":"1992","unstructured":"Alan Frieze, andStephen Suen: Counting the number of Hamiltonian cycles in random digraphs,Random Structures and Algorithms 3 (1992), 235\u2013241.","journal-title":"Random Structures and Algorithms"},{"key":"BF01294460_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(92)90195-2","volume":"34","author":"Peter Gemmell","year":"1992","unstructured":"Peter Gemmell, andMadhu Sudan: Highly resilient correctors for polynomials,Information Processing Letters 34 (1992), 169\u2013174.","journal-title":"Information Processing Letters"},{"key":"BF01294460_CR7","unstructured":"C. D. Godsil, andI. 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 Bolyai25, North-Holland, 1981."},{"key":"BF01294460_CR8","volume-title":"Combinatorial Theory","author":"Marshall Hall Jr","year":"1967","unstructured":"Marshall Hall Jr:Combinatorial Theory, Blaisdell, Waltham Massachusetts, 1967."},{"key":"BF01294460_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1017\/S0963548300001012","volume":"3","author":"Svante Janson","year":"1994","unstructured":"Svante Janson: The Number of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph,Combinatorics, Probability and Computing 3 (1994), 97\u2013126.","journal-title":"Combinatorics, Probability and Computing"},{"key":"BF01294460_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"Mark Jerrum","year":"1989","unstructured":"Mark Jerrum, andAlistair Sinclair: Approximating the permanent,SIAM Journal on Computing 18 (1989), 1149\u20131178.","journal-title":"SIAM Journal on Computing"},{"key":"BF01294460_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"Mark R. Jerrum","year":"1986","unstructured":"Mark R. Jerrum, Leslie G. Valiant, andVijay V. Vazirani: Random generation of combinatorial structures from a uniform distribution,Theoretical Computer Science 43 (1986), 169\u2013188.","journal-title":"Theoretical Computer Science"},{"key":"BF01294460_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1137\/0222021","volume":"22","author":"N. Karmarkar","year":"1993","unstructured":"N. Karmarkar, R. Karp, R. Lipton, L. Lov\u00e1sz, andM. Luby:A Monte-Carlo Algorithm for Estimating the Permanent.SIAM Journal on Computing 22 (1993), 284\u2013293.","journal-title":"SIAM Journal on Computing"},{"key":"BF01294460_CR13","doi-asserted-by":"crossref","unstructured":"R. M. Karp, andM. Luby: Monte-Carlo algorithms for enumeration and reliability problems,Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, 56\u201364.","DOI":"10.1109\/SFCS.1983.35"},{"key":"BF01294460_CR14","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz:Combinatorial Problems and Exercises, North-Holland, 1979."},{"key":"BF01294460_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90115-4","volume":"30","author":"Milena Mihail","year":"1989","unstructured":"Milena Mihail: On coupling and the approximation of the permanent,Information Processing Letters 30 (1989), 91\u201395.","journal-title":"Information Processing Letters"},{"key":"BF01294460_CR16","unstructured":"Henryk Minc:Permanents, Addison Wesley, 1978."},{"key":"BF01294460_CR17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/rsa.3240050208","volume":"5","author":"Lars Eilstrup Rasmussen","year":"1994","unstructured":"Lars Eilstrup Rasmussen: Approximating the Permanent: a Simple Approach,Random Structures and Algorithms 5 (1994), 349\u2013361.","journal-title":"Random Structures and Algorithms"},{"key":"BF01294460_CR18","doi-asserted-by":"publisher","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":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294460.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF01294460\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294460.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T20:50:36Z","timestamp":1736455836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF01294460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01294460"],"URL":"https:\/\/doi.org\/10.1007\/bf01294460","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}