{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:32:01Z","timestamp":1762324321292,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99639-4_22","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T15:43:34Z","timestamp":1534952614000},"page":"319-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Factoring Multivariate Polynomials with Many Factors and Huge Coefficients"],"prefix":"10.1007","author":[{"given":"Michael","family":"Monagan","sequence":"first","affiliation":[]},{"given":"Baris","family":"Tuncer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties and Algorithms","author":"D Cox","year":"2007","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties and Algorithms, 3rd edn. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-35651-8","edition":"3"},{"key":"22_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/b102438","volume-title":"Algorithms for Computer Algebra","author":"KO Geddes","year":"1992","unstructured":"Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer, Boston (1992)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"738","DOI":"10.2307\/2371483","volume":"62","author":"P Erd\u0151s","year":"1940","unstructured":"Erd\u0151s, P., Kac, M.: The Gaussian law of errors in the theory of additive number theoretic functions. Am. J. Math. 62, 738\u2013742 (1940)","journal-title":"Am. J. Math."},{"key":"22_CR4","volume-title":"Transcendental and Algebraic Numbers","author":"AO Gelfond","year":"1952","unstructured":"Gelfond, A.O.: Transcendental and Algebraic Numbers. GITTL, Moscow (1952). English translation by Leo F. Boron, Dover, New York (1960)"},{"key":"22_CR5","first-page":"76","volume":"48","author":"GH Hardy","year":"1917","unstructured":"Hardy, G.H., Ramanujan, S.: The normal number of prime factors of a number $$n$$ . Q. J. Math. 48, 76\u201392 (1917)","journal-title":"Q. J. Math."},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/3-540-15984-3_230","volume-title":"EUROCAL 1885","author":"E Kaltofen","year":"1985","unstructured":"Kaltofen, E.: Sparse hensel lifting. In: Caviness, B.F. (ed.) EUROCAL 1985. LNCS, vol. 204, pp. 4\u201317. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-15984-3_230"},{"key":"22_CR7","volume-title":"Diophantine Geometry","author":"S Lang","year":"1962","unstructured":"Lang, S.: Diophantine Geometry. Wiley, Hoboken (1962)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Law, M.: Computing characteristic polynomials of matrices of structured polynomials, Masters thesis (2017)","DOI":"10.1007\/978-3-319-45641-6_22"},{"key":"22_CR9","unstructured":"Lee, M.M.: Factorization of multivariate polynomials. Ph.D. thesis (2013)"},{"key":"22_CR10","unstructured":"Monagan, M., Tuncer, B.: Some results on counting roots of polynomials and the Sylvester resultant. In: Proceedings of FPSAC 2016, pp. 887\u2013898. DMTCS (2016)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-45641-6_25","volume-title":"Computer Algebra in Scientific Computing","author":"M Monagan","year":"2016","unstructured":"Monagan, M., Tuncer, B.: Using sparse interpolation in hensel lifting. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2016. LNCS, vol. 9890, pp. 381\u2013400. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45641-6_25"},{"key":"22_CR12","unstructured":"Steel, A.: Private communication"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1090\/S0025-5718-1978-0568284-3","volume":"32","author":"PS Wang","year":"1978","unstructured":"Wang, P.S.: An improved multivariate polynomial factoring algorithm. Math. Comput. 32, 1215\u20131231 (1978)","journal-title":"Math. Comput."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1090\/S0025-5718-1975-0396471-3","volume":"29","author":"PS Wang","year":"1975","unstructured":"Wang, P.S., Rothschild, L.P.: Factoring multivariate polynomials over the integers. Math. Comput. 29, 935\u2013950 (1975)","journal-title":"Math. Comput."},{"key":"22_CR15","unstructured":"Yun, D.Y.Y.: The Hensel lemma in algebraic manipulation. Ph.D. thesis (1974)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Zippel, R.E.: Newton\u2019s iteration and the sparse Hensel algorithm. In: Proceedings of SYMSAC 1981, pp. 68\u201372. ACM (1981)","DOI":"10.1145\/800206.806372"},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0747-7171(08)80018-1","volume":"9","author":"RE Zippel","year":"1990","unstructured":"Zippel, R.E.: Interpolating polynomials from their values. J. Symb. Comput. 9(3), 375\u2013403 (1990)","journal-title":"J. Symb. Comput."},{"key":"22_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3188-3","volume-title":"Effective Polynomial Computation","author":"RE Zippel","year":"1993","unstructured":"Zippel, R.E.: Effective Polynomial Computation. Kluwer, Boston (1993)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99639-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T15:38:47Z","timestamp":1571758727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99639-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99639-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}