{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T11:35:59Z","timestamp":1782473759878,"version":"3.54.5"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,9,1]],"date-time":"1981-09-01T00:00:00Z","timestamp":368150400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1981,9]]},"DOI":"10.1016\/0196-6774(81)90029-8","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"311-313","source":"Crossref","is-referenced-by-count":58,"title":["The minimum-length generator sequence problem is NP-hard"],"prefix":"10.1016","volume":"2","author":[{"given":"S","family":"Even","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"O","family":"Goldreich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(81)90029-8_BIB1","series-title":"Proceedings, 21st Annual Symposium on the Foundations of Computer Science","first-page":"42","article-title":"Isomorphism of graphs of bounded valence can be tested in polynomial time","author":"Luks","year":"1980"},{"key":"10.1016\/0196-6774(81)90029-8_BIB2","series-title":"Polytechnic of the South Bank","article-title":"Notes on the \u2018Magic Cube\u2019","author":"Singmaster","year":"1980"},{"key":"10.1016\/0196-6774(81)90029-8_BIB3","series-title":"Computational Problems in Abstract Algebra","first-page":"176","article-title":"Computational methods in the study of permutation in groups","author":"Sims","year":"1970"},{"key":"10.1016\/0196-6774(81)90029-8_BIB4","series-title":"Proceedings, 21st Annual Symposium on the Foundations of Computer Science","first-page":"36","article-title":"Polynomial-time algorithms for permutation groups","author":"Furst","year":"1980"},{"key":"10.1016\/0196-6774(81)90029-8_BIB5","first-page":"221","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900298?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900298?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:52:25Z","timestamp":1548744745000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677481900298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,9]]}},"alternative-id":["0196677481900298"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(81)90029-8","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1981,9]]}}}