{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:26:04Z","timestamp":1725495964850},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401117"},{"type":"electronic","value":"9783540448280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44828-4_27","type":"book-chapter","created":{"date-parts":[[2007,11,18]],"date-time":"2007-11-18T06:09:54Z","timestamp":1195366194000},"page":"254-264","source":"Crossref","is-referenced-by-count":7,"title":["Fast Decomposition of Polynomials with Known Galois Group"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Enge","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Morain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,30]]},"reference":[{"issue":"203","key":"27_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.2307\/2152935","volume":"61","author":"A.O.L. Atkin","year":"1993","unstructured":"A.O.L. Atkin and F. Morain. Elliptic curves and primality proving. Math. Comp., 61(203):29\u201368, July 1993.","journal-title":"Math. Comp."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1017\/S1446788700032432","volume":"49","author":"J.D. Dixon","year":"1990","unstructured":"J.D. Dixon. Computing subfields in algebraic number fields. J. Austral. Math. Soc. Ser. A, 49: 434\u2013448, 1990.","journal-title":"J. Austral. Math. Soc. Ser. A"},{"key":"27_CR3","unstructured":"A. Enge, P. Gaudry, G. Hanrot, and P. Zimmermann. Reconstructing a polynomial from its roots. In preparation, 2002."},{"key":"27_CR4","unstructured":"A. Enge and F. Morain. Further investigations of the generalised Weber functions. Preprint, July 2001."},{"key":"27_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-45455-1_21","volume-title":"ANTS IV \u2014 Algorithmic Number Theory","author":"A. Enge","year":"2002","unstructured":"A. Enge and F. Morain. Comparing invariants for class fields of imaginary quadratic fields. In C. Fieker and D. R. Kohel, editors, ANTS IV \u2014 Algorithmic Number Theory, volume 2369 of Lecture Notes in Comput. Sci., pages 252\u2013266. Springer-Verlag, 2002."},{"key":"27_CR6","unstructured":"A. Enge and R. Schertz. Constructing elliptic curves from modular curves of positive genus. Preprint, 2001."},{"key":"27_CR7","unstructured":"A. Enge and P. Zimmermann. mpc \u2014 a library for multiprecision complex arithmetic with exact rounding. Version 0.4.1, available from http:\/\/www.lix.polytechnique.fr\/Labo\/Andreas.Enge ."},{"key":"27_CR8","unstructured":"J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999."},{"key":"27_CR9","unstructured":"T. Granlund et. al. gmp \u2014 gnu multiprecision library. Version 4.1.2, available from http:\/\/www.swox.com\/gmp ."},{"key":"27_CR10","unstructured":"G. Hanrot, V. Lef\u00e8vre, and P. Zimmermann et. al. mpfr \u2014 a library for multiple-precision floating-point computations with exact rounding. Version contained in [9]. Available from http:\/\/www.mpfr.org ."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"G. Hanrot and F. Morain. Solvability by radicals from an algorithmic point of view. In B. Mourrain, editor, Symbolic and algebraic computation, pages 175\u2013182. ACM, 2001. Proceedings ISSAC\u20192001, London, Ontario.","DOI":"10.1145\/384101.384125"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"G. Hanrot and F. Morain. Solvability by radicals from a practical algorithmic point of view. Submitted. Available from http:\/\/www.lix.polytechnique.fr\/Labo\/Francois.Morain , November 2001.","DOI":"10.1145\/384101.384125"},{"key":"27_CR13","unstructured":"E. Hecke. Vorlesungen \u00fcber die Theorie der algebraischen Zahlen. Chelsea Publishing Company, 2nd ed., 1970."},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.5802\/jtnb.227","volume":"10","author":"J. Kl\u00fcners","year":"1998","unstructured":"J. Kl\u00fcners. On computing subfields. A detailed description of the algorithm. J. Th\u00e9or. Nombres Bordeaux, 10:243\u2013271, 1998.","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jsco.1996.0140","volume":"24","author":"J. Kl\u00fcners","year":"1997","unstructured":"J. Kl\u00fcners and M. Pohst. On computing subfields. J. Symbolic Comput., 24:385\u2013397, 1997.","journal-title":"J. Symbolic Comput."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44828-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T17:46:54Z","timestamp":1556992014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44828-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401117","9783540448280"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44828-4_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}