{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:51:16Z","timestamp":1725587476307},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214929"},{"type":"electronic","value":"9783642214936"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21493-6_11","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T08:42:44Z","timestamp":1308559364000},"page":"174-184","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Computing a Basis of a Finite Abelian Group"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Karagiorgos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Poulakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0020-0190(85)90086-9","volume":"20","author":"W.M. Beynon","year":"1985","unstructured":"Beynon, W.M., Iliopoulos, C.S.: Computing a basis for a finite abelian p-group. Information Processing Letters\u00a020, 161\u2013163 (1985)","journal-title":"Information Processing Letters"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11555964_5","volume-title":"Computer Algebra in Scientific Computing","author":"M. Borges-Quintana","year":"2005","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., Mart\u00ednez-Moro, E.: On the use of gr\u00f6bner bases for computing the structure of finite abelian groups. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E. (eds.) CASC 2005. LNCS, vol.\u00a03718, pp. 52\u201364. Springer, Heidelberg (2005)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1090\/S0025-5718-05-01740-0","volume":"74","author":"J. Buchmann","year":"2005","unstructured":"Buchmann, J., Schmidt, A.: Computing the structure of a finite abelian group. Mathematics of Computation\u00a074, 2017\u20132026 (2005)","journal-title":"Mathematics of Computation"},{"key":"11_CR4","first-page":"27","volume":"2","author":"L. Chen","year":"1984","unstructured":"Chen, L.: Algorithms and their complexity analysis for some problems in finite group. Journal of Sandong Normal University\u00a02, 27\u201333 (1984) (in Chinese)","journal-title":"Journal of Sandong Normal University"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Chen, L., Fu, B.: Linear Sublinear Time Algorithms for the Basis of Abelian groups. Theoretical Computer Science (2010), doi:10.1016\/j.tcs.2010.06.011","DOI":"10.1016\/j.tcs.2010.06.011"},{"issue":"3","key":"11_CR6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.26421\/QIC1.3-2","volume":"1","author":"K.H. Cheung","year":"2001","unstructured":"Cheung, K.H., Mosca, M.: Decomposing finite abelian groups. Journal of Quantum Information and Computation\u00a01(3), 26\u201332 (2001)","journal-title":"Journal of Quantum Information and Computation"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Dinur I., Grigorescu E., Kopparty S., Sudan M.:, Decodability of Group Homomorphisms beyond the Johnson Bound, ECCC Report, No 20 (2008) and in 40th STOC 275-284 (2008)","DOI":"10.1145\/1374376.1374418"},{"key":"11_CR8","volume-title":"Modern Computer Algebra","author":"J. Gathen","year":"1999","unstructured":"Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"},{"key":"11_CR9","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1979","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, Oxford (1979)","edition":"5"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(85)90052-3","volume":"20","author":"C.S. Iliopoulos","year":"1985","unstructured":"Iliopoulos, C.S.: Analysis of algorithms on problems in general abelian groups. Information Processing Letters\u00a020, 215\u2013220 (1985)","journal-title":"Information Processing Letters"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/0218045","volume":"18","author":"C.S. Iliopoulos","year":"1989","unstructured":"Iliopoulos, C.S.: Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix. SIAM Journal of Computing\u00a018(4), 658\u2013669 (1989)","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1070\/RM1997v052n06ABEH002155","volume":"52","author":"A.Y. Kitaev","year":"1997","unstructured":"Kitaev, A.Y.: Quantum computations: algorithms and error correction. Russian Math. Surveys\u00a052(6), 1191\u20131249 (1997)","journal-title":"Russian Math. Surveys"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0036144503439190","volume":"46","author":"N. Koblitz","year":"2004","unstructured":"Koblitz, N., Menezes, A.J.: A survey of public-key cryptosystems. SIAM Review\u00a046(4), 599\u2013634 (2004)","journal-title":"SIAM Review"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/10722028_24","volume-title":"Algorithmic Number Theory","author":"A.R. Kohel","year":"2000","unstructured":"Kohel, A.R., Shparlinski, I.E.: Exponential sums and group generators for elliptic curves over finite fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 395\u2013404. Springer, Heidelberg (2000)"},{"key":"11_CR15","volume-title":"Introduction to group theory","author":"W. Ledermann","year":"1973","unstructured":"Ledermann, W.: Introduction to group theory. Longman Group Limited, London (1973)"},{"key":"11_CR16","unstructured":"Lomont C.: The hidden subgroup problem - review and open problems (2004), http:\/\/arxiv.org\/abs\/quantph\/0411037"},{"issue":"5","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM Journal of Computing"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1006\/jsco.1999.0279","volume":"27","author":"E. Teske","year":"1999","unstructured":"Teske, E.: The Pohlig-Hellman Method Generalized for Group Structure Computation. Journal of Symbolic Computation\u00a027, 521\u2013534 (1999)","journal-title":"Journal of Symbolic Computation"},{"issue":"224","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1090\/S0025-5718-98-00968-5","volume":"67","author":"E. Teske","year":"1998","unstructured":"Teske, E.: A space efficient algorithm for group structure computation. Mathematics of Computation\u00a067(224), 1637\u20131663 (1998)","journal-title":"Mathematics of Computation"},{"key":"11_CR20","doi-asserted-by":"crossref","DOI":"10.4324\/9780203484029","volume-title":"Elliptic Curves","author":"L.C. Washington","year":"2003","unstructured":"Washington, L.C.: Elliptic Curves. Chapman and Hall, Boca Raton (2003)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21493-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T19:05:21Z","timestamp":1637867121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21493-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214929","9783642214936"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21493-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}