{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T03:57:03Z","timestamp":1775102223868,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00200-008-0062-4","type":"journal-article","created":{"date-parts":[[2008,1,31]],"date-time":"2008-01-31T12:19:53Z","timestamp":1201781993000},"page":"135-160","source":"Crossref","is-referenced-by-count":19,"title":["Fast separable factorization and applications"],"prefix":"10.1007","volume":"19","author":[{"given":"Gr\u00e9goire","family":"Lecerf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,2,1]]},"reference":[{"key":"62_CR1","unstructured":"Belabas, K., Hoeij, M., Kl\u00fcners, J., Steel, A.: Factoring polynomials over global fields (2004) Manuscript available at http:\/\/arxiv.org\/abs\/math.NT\/0409510"},{"issue":"1\u20132","key":"62_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0304-3975(97)00059-5","volume":"187","author":"L. Bernardin","year":"1997","unstructured":"Bernardin L. (1997). On square-free factorization of multivariate polynomials over a finite field. Theor. Comput. Sci. 187(1\u20132): 105\u2013116","journal-title":"Theor. Comput. Sci."},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"Bernardin, L., Monagan, M.B.: Efficient multivariate factorization over finite fields. In: Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Toulouse, 1997). Lecture Notes in Comput. Sci., vol. 1255, pp. 15\u201328. Springer, Heidelberg (1997)","DOI":"10.1007\/3-540-63163-1_2"},{"key":"62_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser P., Clausen M. and Shokrollahi M.A. (1997). Algebraic Complexity Theory. Springer, Heidelberg"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Davenport, J.H., Trager, B.M.: Factorization over finitely generated fields. In: SYMSAC\u201981: Proceedings of the Fourth ACM Symposium on Symbolic and Algebraic Computation, pp. 200\u2013205. ACM Press, New York (1981)","DOI":"10.1145\/800206.806396"},{"issue":"4","key":"62_CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/500457.500460","volume":"33","author":"E. Fortuna","year":"1999","unstructured":"Fortuna E. and Gianni P. (1999). Square-free decomposition in finite characteristic: an application to Jordan form computation. SIGSAM Bull. 33(4): 14\u201332","journal-title":"SIGSAM Bull."},{"key":"62_CR7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01180640","volume":"62","author":"A. Fr\u00f6hlich","year":"1955","unstructured":"Fr\u00f6hlich A. and Shepherdson J.C. (1955). On the factorisation of polynomials in a finite number of steps. Math. Z. 62: 331\u2013334","journal-title":"Math. Z."},{"key":"62_CR8","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1098\/rsta.1956.0003","volume":"248","author":"A. Fr\u00f6hlich","year":"1956","unstructured":"Fr\u00f6hlich A. and Shepherdson J.C. (1956). Effective procedures in field theory. Philos. Trans. Roy. Soc. Lond. Ser. A. 248: 407\u2013432","journal-title":"Philos. Trans. Roy. Soc. Lond. Ser. A."},{"issue":"2","key":"62_CR9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/jabr.2000.8586","volume":"237","author":"S. Gao","year":"2001","unstructured":"Gao S. (2001). Absolute irreducibility of polynomials via Newton polytopes. J. Algebra 237(2): 501\u2013520","journal-title":"J. Algebra"},{"issue":"166","key":"62_CR10","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0025-5718-1984-0736459-9","volume":"42","author":"J. Gathen von zur","year":"1984","unstructured":"Gathen J. (1984). Hensel and Newton methods in valuation rings. Math. Comp. 42(166): 637\u2013661","journal-title":"Math. Comp."},{"key":"62_CR11","unstructured":"J.von zur Gathen.: Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)"},{"issue":"3","key":"62_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/PL00004222","volume":"11","author":"J. Gerhard","year":"2001","unstructured":"Gerhard J. (2001). Fast modular algorithms for squarefree factorization and Hermite integration. Appl. Algebra Eng. Commun. Comput. 11(3): 203\u2013226","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"1","key":"62_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01613611","volume":"7","author":"P. Gianni","year":"1996","unstructured":"Gianni P. and Trager B. (1996). Square-free algorithms in positive characteristic. Appl. Algebra Eng. Commun. Comput. 7(1): 1\u201314","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"1","key":"62_CR14","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1007\/BF01206635","volume":"95","author":"G. Hermann","year":"1926","unstructured":"Hermann G. (1926). Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Math. Ann. 95(1): 736\u2013788","journal-title":"Math. Ann."},{"key":"62_CR15","doi-asserted-by":"crossref","unstructured":"Javadi, S.M.M., Monagan, M.: A sparse modular GCD algorithm for polynomials over algebraic function fields. In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, pp. 187\u2013194. ACM Press, New York (2007)","DOI":"10.1145\/1277548.1277575"},{"key":"62_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-7091-3406-1_8","volume-title":"Computer algebra","author":"E. Kaltofen","year":"1982","unstructured":"Kaltofen E. (1982). Polynomial factorization. In: Buchberger, B., Collins, G. and Loos, R. (eds) Computer algebra, pp 95\u2013113. Springer, Heidelberg"},{"key":"62_CR17","doi-asserted-by":"crossref","unstructured":"Kaltofen, E.: Polynomial factorization 1982\u20131986. In: Computers in Mathematics (Stanford, CA, 1986), Lecture Notes in Pure and Appl. Math., vol. 125, pp. 285\u2013309. Dekker, New York (1990)","DOI":"10.1201\/9781003072157-9"},{"key":"62_CR18","doi-asserted-by":"crossref","unstructured":"Kaltofen, E.: Polynomial factorization 1987\u20131991. In: LATIN \u201992 (S ao Paulo, 1992), Lecture Notes in Comput. Sci., vol. 583, pp. 294\u2013313. Springer, Heidelberg (1992)","DOI":"10.1007\/BFb0023837"},{"key":"62_CR19","first-page":"1","volume":"92","author":"L. Kronecker","year":"1882","unstructured":"Kronecker L. (1882). Grundz\u00fcge einer arithmetischen theorie de algebraischen gr\u00f6ssen. J. Reine Angew. Math. 92: 1\u2013122","journal-title":"J. Reine Angew. Math."},{"key":"62_CR20","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1090\/S0025-5718-06-01810-2","volume":"75","author":"G. Lecerf","year":"2006","unstructured":"Lecerf G. (2006). Sharp precision in Hensel lifting for bivariate polynomial factorization. Math. Comp. 75: 921\u2013933","journal-title":"Math. Comp."},{"issue":"4","key":"62_CR21","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.jsc.2007.01.003","volume":"42","author":"G. Lecerf","year":"2007","unstructured":"Lecerf G. (2007). Improved dense multivariate polynomial factorization algorithms. J. Symbolic Comput. 42(4): 477\u2013494","journal-title":"J. Symbolic Comput."},{"key":"62_CR22","unstructured":"Lecerf, G.: New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (2007). Manuscript"},{"key":"62_CR23","unstructured":"The Magma computational algebra system for algebra, number theory and geometry. http:\/\/magma.maths.usyd.edu.au\/magma\/ . Computational Algebra Group, School of Mathematics and Statistics, University of Sydney, NSW 2006 Australia"},{"issue":"1","key":"62_CR24","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1216\/RMJ-1982-12-1-43","volume":"12","author":"R. Mines","year":"1982","unstructured":"Mines R. and Richman F. (1982). Separability and factoring polynomials. Rocky Mountain J. Math. 12(1): 43\u201354","journal-title":"Rocky Mountain J. Math."},{"key":"62_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8640-5","volume-title":"A course in constructive algebra. Universitext","author":"R. Mines","year":"1988","unstructured":"Mines R., Richman F. and Ruitenburg W. (1988). A course in constructive algebra. Universitext. Springer, Heidelberg"},{"key":"62_CR26","unstructured":"Musser, D.R.: Algorithms for polynomial factorization. PhD Thesis, C.S. Department, University of Wisconsin (1971)"},{"key":"62_CR27","doi-asserted-by":"crossref","unstructured":"Richman, F.: Seidenberg\u2019s condition P. In: Constructive mathematics (Las Cruces, N.M., 1980), Lecture Notes in Math., vol. 873, pp. 1\u201311. Springer, Heidelberg (1981)","DOI":"10.1007\/BFb0090722"},{"key":"62_CR28","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/BF02923228","volume":"40","author":"A. Seidenberg","year":"1970","unstructured":"Seidenberg A. (1970). Construction of the integral closure of a finite integral domain. Rend. Sem. Mat. Fis. Milano 40: 100\u2013120","journal-title":"Rend. Sem. Mat. Fis. Milano"},{"key":"62_CR29","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1090\/S0002-9947-1974-0349648-2","volume":"197","author":"A. Seidenberg","year":"1974","unstructured":"Seidenberg A. (1974). Constructions in algebra. Trans. Am. Math. Soc. 197: 273\u2013313","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"62_CR30","doi-asserted-by":"crossref","first-page":"685","DOI":"10.2307\/2373905","volume":"100","author":"A. Seidenberg","year":"1978","unstructured":"Seidenberg A. (1978). Constructions in a polynomial ring over the ring of integers. Am. J. Math. 100(4): 685\u2013703","journal-title":"Am. J. Math."},{"issue":"3","key":"62_CR31","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1016\/j.jsc.2005.03.002","volume":"40","author":"A. Steel","year":"2005","unstructured":"Steel A. (2005). Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic. J. Symbolic Comput. 40(3): 1053\u20131075","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"62_CR32","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1007\/BF01782374","volume":"102","author":"B.L. Waerden van der","year":"1930","unstructured":"Waerden B.L. (1930). Eine Bemerkung \u00fcber die Unzerlegbarkeit von Polynomen. Math. Ann. 102(1): 738\u2013739","journal-title":"Math. Ann."},{"key":"62_CR33","volume-title":"Modern Algebra. vol. I","author":"B.L. Waerden van der","year":"1949","unstructured":"Waerden B.L. (1949). Modern Algebra. vol. I. Frederick Ungar Publishing Co., New York"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-008-0062-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-008-0062-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-008-0062-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T04:02:12Z","timestamp":1630641732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-008-0062-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,1]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s00200-008-0062-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,1]]}}}