{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:12:21Z","timestamp":1648764741496},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,2,1]],"date-time":"1988-02-01T00:00:00Z","timestamp":570672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9298,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,2]]},"DOI":"10.1016\/0304-3975(88)90078-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"211-222","source":"Crossref","is-referenced-by-count":0,"title":["On the computational complexity of the abelian permutation group structure, membership and intersection problems"],"prefix":"10.1016","volume":"56","author":[{"given":"Costa S.","family":"Iliopoulos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90078-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(88)90078-3_BIB2","doi-asserted-by":"crossref","unstructured":"A. Borodin, J. Von Zur Gathen and J. Hopcroft, Fast parallel matrix and gcd computations, Inform. and Control, to appear.","DOI":"10.1109\/SFCS.1982.17"},{"key":"10.1016\/0304-3975(88)90078-3_BIB3","series-title":"Problems in Group Theory","author":"Dixon","year":"1973"},{"key":"10.1016\/0304-3975(88)90078-3_BIB4","first-page":"36","article-title":"Polynomial time algorithms for permulation groups","author":"Furst","year":"1980","journal-title":"Proc. 22nd FOCS"},{"key":"10.1016\/0304-3975(88)90078-3_BIB5","series-title":"Group-theoretic Algorithms and Graph Isomorphism","author":"Hoffman","year":"1982"},{"key":"10.1016\/0304-3975(88)90078-3_BIB6","series-title":"Integer Programming and Network Flows","author":"Hu","year":"1969"},{"key":"10.1016\/0304-3975(88)90078-3_BIB7","series-title":"Ph.D. Thesis","article-title":"Algorithms in the theory of abelian groups","author":"Iliopoulos","year":"1983"},{"key":"10.1016\/0304-3975(88)90078-3_BIB8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(85)90052-3","article-title":"Analysis of algorithms on problems in general abelian groups","volume":"20","author":"Iliopoulos","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(88)90078-3_BIB9","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/BF00264315","article-title":"Monte Carlo circuits for the abelian permutation group intersection problem","volume":"23","author":"Iliopoulos","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(88)90078-3_BIB10","series-title":"Proc. EUROCAL 85","first-page":"225","article-title":"Worst-case analysis of algorithms for computational problems on abelian permutation groups","volume":"204","author":"Iliopoulos","year":"1985"},{"key":"10.1016\/0304-3975(88)90078-3_BIB11","series-title":"Seminumerical Algorithms","author":"Knuth","year":"1969"},{"key":"10.1016\/0304-3975(88)90078-3_BIB12","first-page":"154","article-title":"The parallel complexity of the abelian permutation membership problem","author":"McKenzie","year":"1982","journal-title":"Proc. 24th FOCS"},{"key":"10.1016\/0304-3975(88)90078-3_BIB13","series-title":"Finite Permutation Groups","author":"Wielandt","year":"1964"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900783?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900783?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:21Z","timestamp":1555127601000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588900783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,2]]}},"alternative-id":["0304397588900783"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90078-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,2]]}}}