{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T09:17:02Z","timestamp":1776849422773,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676959","type":"print"},{"value":"9783540449942","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722028_10","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T23:45:30Z","timestamp":1167435930000},"page":"185-208","source":"Crossref","is-referenced-by-count":13,"title":["Factoring Polynomials over \u03c1-Adic Fields"],"prefix":"10.1007","author":[{"given":"David G.","family":"Cantor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel M.","family":"Gordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Algebraic numbers and algebraic functions","author":"E. Artin","year":"1967","unstructured":"Artin, E.: Algebraic numbers and algebraic functions. Gordon and Breach, NewYork (1967)"},{"key":"10_CR2","unstructured":"Batut, C., Belabas, K., Bernardi, D., Cohen, H., Olivier, M.: User\u2019s guide to PARI-GP, for version 2.0.10 (July 1998)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"R. Elwyn","year":"1970","unstructured":"Elwyn, R.: Berlekamp. Factoring polynomials over large finite fields. Mathematics of Computation\u00a024, 713\u2013735 (1970)","journal-title":"Mathematics of Computation"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The magma algebra system I: The user language. J. Symb. Comp.\u00a024, 235\u2013269 (1997)","journal-title":"J. Symb. Comp."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"G. David","year":"1981","unstructured":"David, G.: Cantor and Hans Zassenhaus. A new algorithm for factoring polynomials over finite fields. Mathematics of Computation\u00a036, 587\u2013592 (1981)","journal-title":"Mathematics of Computation"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Cassels, J.W.S.: Local Fields. Cambridge University Press, Cambridge (1986) ISBN 0-521-30484-9 (hard cover) or 0-521-31525-5 (paper back)","DOI":"10.1017\/CBO9781139171885"},{"key":"10_CR7","first-page":"430","volume":"35","author":"A.L. Chistov","year":"1987","unstructured":"Chistov, A.L.: Efficient factorization of polynomials over local fields. Soviet Math.Doklady\u00a035, 430\u2013433 (1987); Translated from Russian original","journal-title":"Soviet Math.Doklady"},{"key":"10_CR8","first-page":"1509","volume-title":"Proceedings of the international congress of mathematicians","author":"A.L. Chistov","year":"1991","unstructured":"Chistov, A.L.: Efficient factoring polynomials over local fields and its applicatons. In: Proceedings of the international congress of mathematicians, Kyoto, Japan, August 21-29, vol.\u00a02, pp. 1509\u20131519. Springer, Heidelberg (1991) ISBN 0-387- 70047-1"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1007\/BF02112431","volume":"70","author":"A.L. Chistov","year":"1994","unstructured":"Chistov, A.L.: Algorithm of polynomial complexity for factoring polynomials overlocal fields. Journal of mathematical sciences\u00a070, 1912\u20131933 (1994); Translated from Russian original","journal-title":"Journal of mathematical sciences"},{"key":"10_CR10","volume-title":"A course in computational algebraic number theory","author":"H. Cohen","year":"1994","unstructured":"Cohen, H.: A course in computational algebraic number theory. Springer, Heidelberg (1994); ISBN 0-387-55640-0 or 3-546-55640-0"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.5802\/jtnb.105","volume":"6","author":"D. Ford","year":"1994","unstructured":"Ford, D., Letard, P.: Implementing the round four maximal order algorithm. Journal de Th\u00e9orie des Nombres des Bordeaux\u00a06, 33\u201380 (1994)","journal-title":"Journal de Th\u00e9orie des Nombres des Bordeaux"},{"key":"10_CR12","unstructured":"Gianni, P., Miller, V., Trager, B.: Decomposiition of algebras (unpublished)"},{"key":"10_CR13","unstructured":"Gordon, D.M.: Web Site, \n                    \n                      http:\/\/sdcc12.ucsd.edu\/~xm3dg"},{"key":"10_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22278-2","volume-title":"p-adic Numbers","author":"F. Gouvea","year":"1993","unstructured":"Gouvea, F.: pad\u00e9 Numbers. Springer, Heidelberg (1993) ISBN 0-387-56844-1"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/1014001","volume":"14","author":"W.B. Gragg","year":"1972","unstructured":"Gragg, W.B.: The Pad\u00e9 table and its relation to certain algorithms of numerical analysis. SIAM Review\u00a014, \u201362 (1972)","journal-title":"SIAM Review"},{"key":"10_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-66671-1","volume-title":"Number Theory","author":"H. Hasse","year":"1980","unstructured":"Hasse, H.: Number Theory. Springer, Heidelberg (1980); ISBN 0-387-08275-1"},{"key":"10_CR17","unstructured":"Hensel, K.: Theorie der Algebraischen Zahlen. B. G. Teubner (1908)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Efficient resolution of singularities of plane curves. In: Proceedings 14th conference on foundations of software technology and theoretical computer science (1994)","DOI":"10.1007\/3-540-58715-2_109"},{"key":"10_CR19","volume-title":"Algebra","author":"S. Lang","year":"1984","unstructured":"Lang, S.: Algebra. Addison-Wesley, Reading (1984)"},{"key":"10_CR20","first-page":"115","volume-title":"Computer Algebra Symbolic and Algebraic Camputation","author":"R. Loos","year":"1983","unstructured":"Loos, R.: Generalized polynomial remainder sequences. In: Buchberger, B., Collins, G.E., Loos, R. (eds.) Computer Algebra Symbolic and Algebraic Camputation, 2nd edn., pp. 115\u2013136. Springer, Heidelberg (1983) ISBN 0-387-81776-X","edition":"2"},{"key":"10_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9356-6","volume-title":"Number Fields","author":"D.A. Marcus","year":"1977","unstructured":"Marcus, D.A.: Number Fields. Springer, Heidelberg (1977) ISBN 0-387-90279-1 or 3-540-90279-1"},{"key":"10_CR22","volume-title":"Elementary and analytic theroy of algebraic numbers","author":"W. Narkiewicz","year":"1989","unstructured":"Narkiewicz, W.: Elementary and analytic theroy of algebraic numbers, 2nd edn. Springer, Heidelberg (1989) ISBN 0-387-51250-9","edition":"2"},{"key":"10_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8589-8","volume-title":"Computational algebraic number theory","author":"M.E. Pohst","year":"1993","unstructured":"Pohst, M.E.: Computational algebraic number theory. Birkh\u00e4user Verlag, Basel (1993) ISBN 0-8176-2913-0 or 3-7643-2913-0"},{"key":"10_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0551-7","volume-title":"The theory of classical valuations","author":"P. Ribenboim","year":"1999","unstructured":"Ribenboim, P.: The theory of classical valuations. Springer, Heidelberg (1999) ISBN 0-387-98525-5"},{"key":"10_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511661952","volume-title":"Algorithmic algebraic number theory","author":"M.E. Pohst","year":"1989","unstructured":"Pohst, M.E., Zassenhaus, H.: Algorithmic algebraic number theory. Cambridge University Press, Cambridge (1989) ISBN 0-521-33060-2"},{"key":"10_CR26","volume-title":"Algebraic Number Theory","author":"I. Stewart","year":"1987","unstructured":"Stewart, I., Tall, D.: Algebraic Number Theory. Chapman and Hall, Boca Raton (1987) ISBN 0-412-29870-8 or 0-412-29690-X"},{"key":"10_CR27","volume-title":"Basic Number Theory","author":"A. Weil","year":"1970","unstructured":"Weil, A.: Basic Number Theory. Springer, Heidelberg (1970)"},{"key":"10_CR28","volume-title":"Algebraic Number Theory","author":"E. Weiss","year":"1963","unstructured":"Weiss, E.: Algebraic Number Theory. McGraw-Hill, New York (1963)"},{"key":"10_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3188-3","volume-title":"Effiective Polynomial Computation","author":"R. Zippel","year":"1993","unstructured":"Zippel, R.: Effiective Polynomial Computation. Kluwer Academic Press, Dordrecht (1993) ISBN 0-7923-9375-9"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10722028_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T09:32:54Z","timestamp":1553333574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722028_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676959","9783540449942"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/10722028_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}