{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:00Z","timestamp":1770994080239,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,5,1]],"date-time":"1985-05-01T00:00:00Z","timestamp":483753600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1985,5]]},"DOI":"10.1016\/0020-0190(85)90052-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"215-220","source":"Crossref","is-referenced-by-count":6,"title":["Analysis of algorithms on problems in general abelian groups"],"prefix":"10.1016","volume":"20","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(85)90052-3_BIB1","series-title":"Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"3","key":"10.1016\/0020-0190(85)90052-3_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(85)90086-9","article-title":"Computing an extension of a p-group","volume":"20","author":"Beynon","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(85)90052-3_BIB3","series-title":"Integer Programming and Networks Flows","author":"Hu","year":"1969"},{"key":"10.1016\/0020-0190(85)90052-3_BIB4","doi-asserted-by":"crossref","unstructured":"C.S. Iliopoulos, Computing on general abelian groups is hard, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/0304-3975(85)90061-1"},{"key":"10.1016\/0020-0190(85)90052-3_BIB5","series-title":"22nd Ann. Symp. on FOCS","article-title":"Computation on algebraic functions","author":"Ja'Ja'","year":"1981"},{"key":"10.1016\/0020-0190(85)90052-3_BIB6","volume":"Vol. III","author":"Knuth","year":"1969"},{"key":"10.1016\/0020-0190(85)90052-3_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","article-title":"Schnelle Berechung von Kettenbruchentwicklungen","volume":"1","author":"Sch\u00f6nhage","year":"1971","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(85)90052-3_BIB8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","article-title":"Schnelle Multiplication grosser Zahlen","volume":"7","author":"Sch\u00f6nhage","year":"1972","journal-title":"Computing"},{"key":"10.1016\/0020-0190(85)90052-3_BIB9","first-page":"435","article-title":"Class number, a theory of factorization and genera","volume":"Vol. 20","author":"Shanks","year":"1971"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:26:47Z","timestamp":1553592407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["0020019085900523"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90052-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}