{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:29:08Z","timestamp":1725456548374},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540513711"},{"type":"electronic","value":"9783540462019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035769","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:00:28Z","timestamp":1133409628000},"page":"319-340","source":"Crossref","is-referenced-by-count":0,"title":["On dice and coins: models of computation for random generation"],"prefix":"10.1007","author":[{"given":"David","family":"Feldman","sequence":"first","affiliation":[]},{"given":"Russell","family":"Impagliazzo","sequence":"additional","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Rudich","sequence":"additional","affiliation":[]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"22_CR1","unstructured":"Shimon Even, Graph Algorithms, Computer Science Press, 1979."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"John Gill, \u201cComputational Complexity of Probabilistic Turing Machines.,\u201d Siam Journal on Computing, vol. 6, pp. 675\u2013695, 1977.","journal-title":"Siam Journal on Computing"},{"key":"22_CR3","unstructured":"Hardy and Wright, Introduction to Number Theory, Academic Press, 1972."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Hartshorne, Algebraic Geometry, Springer-Verlag, 1977.","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M. Jerrum","year":"1986","unstructured":"Mark Jerrum, Leslie Valiant, and Vijay Vazirani, \u201cRandom Generation of Combinatorial Structures from a Uniform Distribution.,\u201d Theoretical Computer Science, vol. 43, pp. 169\u2013188, 1986.","journal-title":"Theoretical Computer Science"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Richard Karp, and Michael Luby, \u201cMonte Carlo algorithms for enumeration and reliability problems.,\u201d Proc. 24th IEEE Symp. on Foundations of Computer Science, pp. 56\u201364, 1983.","DOI":"10.1109\/SFCS.1983.35"},{"key":"22_CR7","unstructured":"B. L. van der Waerden, Algebra, Frederick Ungar, 1970."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:31:59Z","timestamp":1586579519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0035769","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}