{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:13Z","timestamp":1725662893962},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_24","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:02:12Z","timestamp":1330174932000},"page":"270-280","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of finding minimum-length generator sequences"],"prefix":"10.1007","author":[{"given":"Mark","family":"Jerrum","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"24_CR1","unstructured":"Beriekamp, E.R., Conway, J.H. and Guy, R.K. \"Winning Ways. Vol. 2 \u2014 Games in Particular\". Academic Press, 1982."},{"key":"24_CR2","first-page":"527","volume":"34","author":"A. Cayley","year":"1849","unstructured":"Cayley, A. Note on the Theory of Permutations. Philosophical Magazine 34 (1849), pp. 527\u2013529.","journal-title":"Philosophical Magazine"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Driscoll, J.R. and Furst, M.L. On the Diameter of Permutation Groups. Proc. 15th ACM Symposium on Theory of Computing, 1983, pp. 152\u2013160.","DOI":"10.1145\/800061.808744"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0196-6774(81)90029-8","volume":"2","author":"S. Even","year":"1981","unstructured":"Even, S. and Goldreich, O. The Minimum-length Generator Sequence Problem is NP-hard. J. Algorithms 2 (1981), pp. 311\u2013313.","journal-title":"J. Algorithms"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Furst, M., Hopcroft, J. and Luks, E. Polynomial-time Algorithms for Permutation Groups. Proc. 21st IEEE Symposium on Foundations of Computer Science. IEEE. 1981, pp. 36\u201341.","DOI":"10.1109\/SFCS.1980.34"},{"key":"24_CR6","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S. \"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness\". Freeman, San Francisco, 1979."},{"key":"24_CR7","volume-title":"The Theory of Groups","author":"M. Hall","year":"1959","unstructured":"Hall, M. \"The Theory of Groups\". Macmilian, New York, 1959."},{"key":"24_CR8","unstructured":"Hardy, G.H. and Wright, E.M. \"An Introduction to the Theory of Numbers\". Oxford, 1938."},{"key":"24_CR9","unstructured":"Hopcroft, J.E. and Ullman, J.D. \"Introduction to Automata Theory, Languages and Computation\". Addison-Wesley, 1979."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Jerrum, M.R. A Compact Representation for Permutation Groups. Proc. 23rd IEEE Symposium on Foundations of Computer Science. 1982, pp. 126\u2013133.","DOI":"10.1109\/SFCS.1982.52"},{"key":"24_CR11","unstructured":"Jerrum, M.R. The Complexity of Finding Minimum-length Generator Sequences. Internal Report CSR-139-83. Department of Computer Science. University of Edinburgh, July, 1983. (Submitted to Theoretical Computer Science)."},{"key":"24_CR12","unstructured":"Knuth, D.E. The Art of Computer Programming. Volume 3: \"Sorting and Searching\". Addison-Wesley, 1973."},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. J. Savitch","year":"1970","unstructured":"Savitch, W.J. Relationships between Nondeterministic and Deterministic Tape Complexities. J. Computer and Systems Sciences 4 (1970), pp. 177\u2013192.","journal-title":"J. Computer and Systems Sciences"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Sims, C.C. Computational Methods in the Study of Permutation Groups. In \"Computational Problems in Abstract Algebra\", Leech, J. (Ed.), Pergamon Press, 1970, pp. 169\u2013183.","DOI":"10.1016\/B978-0-08-012975-4.50020-5"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:12:39Z","timestamp":1578507159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_24"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}