{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:14Z","timestamp":1725456074150},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354015650X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015754","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:45:47Z","timestamp":1132724747000},"page":"290-299","source":"Crossref","is-referenced-by-count":3,"title":["Random generation of combinatiorial structures from a uniform distribution"],"prefix":"10.1007","author":[{"given":"Mark","family":"Jerrum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Bach, E. How to Generate Random Integers with Known Factorisation. Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 184\u2013188.","DOI":"10.1145\/800061.808747"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0196-6774(83)90021-4","volume":"4","author":"J.D. Dixon","year":"1983","unstructured":"Dixon, J.D. and Wilf, H.S. The Random Selection of Unlabelled Graphs. J. Algorithms 4 (1983), pp. 205\u2013213.","journal-title":"J. Algorithms"},{"key":"29_CR3","unstructured":"Garey, M.R. and Johnson, D.S. Computers and Intractability. Freeman, 1979."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"Gill, J. Computational Complexity of Probabilistic Turing Machines. SIAM J. on Computing 6 (1977), pp. 675\u2013695.","journal-title":"SIAM J. on Computing"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Harary, F. and Palmer, E.M. Craphical Enumeration. Academic Press, 1973.","DOI":"10.1016\/B978-0-12-324245-7.50005-8"},{"key":"29_CR6","unstructured":"Hopcroft, J.E. and Ullman, J.D. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Karp, R.M. and Luby, M. 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":"29_CR8","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P. Optimal Algorithms for Self-Reducible Problems. Proceedings of the 3rd International Colloquium on Automata, Languages and Programming, EATCS, 1976, pp. 322\u2013337.","DOI":"10.1016\/0304-3975(76)90070-0"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Simon, J. On the Difference between One and Many. Proceedings of the 4th International Colloquium on Automata, Languages and Programming, EATCS, 1977, pp. 480\u2013491.","DOI":"10.1007\/3-540-08342-1_37"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"Stockmeyer, L. The Polynomial-time Hierarchy. Theoretical Computer Science 3 (1977), pp. 1\u201322.","journal-title":"Theoretical Computer Science"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L. The Complexity of Approximate Counting. Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 118\u2013126.","DOI":"10.1145\/800061.808740"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Valiant, L.G. The Complexity of Combinatorial Computations: an Introduction. Internal Report CSR-30-78, Department of Computer Science, University of Edinburgh, October, 1978.","DOI":"10.1007\/978-3-642-67091-6_15"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G. The Complexity of Computing the Permanent. Theoretical Computer Science 8 (1979), pp. 189\u2013201.","journal-title":"Theoretical Computer Science"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0196-6774(81)90021-3","volume":"2","author":"H.S. Wilf","year":"1981","unstructured":"Wilf, H.S. The Uniform Selection of Free Trees. J. Algorithms 2 (1981), pp. 204\u2013207.","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:32:32Z","timestamp":1683300752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354015650X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0015754","relation":{},"subject":[]}}