{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:31:10Z","timestamp":1725456670460},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354013350X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032850","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:41:26Z","timestamp":1133412086000},"page":"277-284","source":"Crossref","is-referenced-by-count":2,"title":["Effective Hilbert irreducibility"],"prefix":"10.1007","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E.R. Berlekamp","year":"1970","unstructured":"Berlekamp, E.R.: Factoring Polynomials over Large Finite Fields. Math. Comp. 24, 713\u2013735 (1970).","journal-title":"Math. Comp."},{"unstructured":"Chistov, A.L., Grigoryev, D.Y.: Polynomial-Time Factoring of Multivariate Polynomials over a Global Field. Lomi preprint E-5-82, Leningrad 1982.","key":"27_CR2"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/BF01206597","volume":"95","author":"K. D\u00f6rge","year":"1926","unstructured":"D\u00f6rge, K.: Zum Hilbertschen Irreduzibilit\u00e4tssatz. Mathematische Annalen 95, 84\u201397 (1926).","journal-title":"Mathematische Annalen"},{"doi-asserted-by":"crossref","unstructured":"von zur Gathen, J.: Factoring Sparse Multivariate Polynomials. Proceedings 1983 IEEE Symposium on Foundations of Computer Science, 172\u2013179.","key":"27_CR4","DOI":"10.1109\/SFCS.1983.15"},{"unstructured":"von zur Gathen, J., Kaltofen, E.: A Polynomial-Time Algorithm for Factoring Multivariate Polynomials Over Finite Fields. Proc. 1983 Internat. Conf. Automata, Languages and Programming. Springer Lec. Notes Comp. Sci. 154, 250\u2013263.","key":"27_CR5"},{"doi-asserted-by":"crossref","unstructured":"Heintz, J., Sieveking, M.: Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. Proc. 1981 Internat. Conf. Automata, Languages and Programming. Springer Lec. Notes Comp. Sci. 115, 16\u201328.","key":"27_CR6","DOI":"10.1007\/3-540-10843-2_2"},{"unstructured":"Kaltofen, E.: A Polynomial Reduction from Multivariate to Bivariate Integer Polynomial Factorization. Proc. 1982 ACM Symp. Theory Comp., 261\u2013266.","key":"27_CR7"},{"doi-asserted-by":"crossref","unstructured":"Kaltofen, E.: A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization. Proceedings 23rd Symposium on Foundations of Computer Science. IEEE, 57\u201364 (1982).","key":"27_CR8","DOI":"10.1109\/SFCS.1982.56"},{"doi-asserted-by":"crossref","unstructured":"Kaltofen, E.: Polynomial-Time Reductions from Multivariate to Bi-and Univariate Integral Polynomial Factorization. SIAM J. Comp., in press.","key":"27_CR9","DOI":"10.1137\/0214035"},{"unstructured":"Landau, S.: Factoring Polynomials over Algebraic Number Fields is in Polynomial Time. SIAM J. Comp., to appear.","key":"27_CR10"},{"doi-asserted-by":"crossref","unstructured":"Lenstra, A.K.: Factoring Polynomials over Algebraic Number Fields. Manuscript 1982.","key":"27_CR11","DOI":"10.1007\/3-540-11607-9_4"},{"doi-asserted-by":"crossref","unstructured":"Lenstra, A.K.: Factoring Multivariate Polynomials over a Finite Field. Proc. 1983 ACM Symp. Theory Comp., 189\u2013192.","key":"27_CR12","DOI":"10.1145\/800061.808748"},{"doi-asserted-by":"crossref","unstructured":"Lenstra, A.K.: Factoring Multivariate Integral Polynomials. Proc. 1983 Internat. Conf. Automata, Languages and Programming. Springer Lec. Notes Comp. Sci. 154, 189\u2013192.","key":"27_CR13","DOI":"10.1007\/BFb0036929"},{"doi-asserted-by":"crossref","unstructured":"Lenstra, A.K.: Factoring Multivariate Polynomials over Algebraic Number Fields. Manuscript 1983.","key":"27_CR14","DOI":"10.1145\/800061.808748"},{"key":"27_CR15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"Lenstra, A. K., Lenstra, H. W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Math. Ann. 261, 515\u2013534 (1982).","journal-title":"Math. Ann."},{"doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A.: Factorization of Univariate Integer Polynomials by Diophantine Approximation and by an Improved Reduction Algorithm. Manuscript 1983.","key":"27_CR16","DOI":"10.1007\/3-540-13345-3_40"},{"key":"27_CR17","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast Probabilistic Algorithms for Verification of Polynomial Identities. J. ACM 27, 701\u2013717 (1980).","journal-title":"J. ACM"},{"unstructured":"Zippel, R. E.: Newton's Iteration and the Sparse Hensel Algorithm. Proc. 1981 ACM Symp. Symbolic Alg. Comp., 68\u201372.","key":"27_CR18"}],"container-title":["Lecture Notes in Computer Science","EUROSAM 84"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:34:14Z","timestamp":1586579654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354013350X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0032850","relation":{},"subject":[]}}