{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T10:10:45Z","timestamp":1776766245023,"version":"3.51.2"},"publisher-location":"Berlin\/Heidelberg","reference-count":129,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540552847","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023837","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:17:40Z","timestamp":1132381060000},"page":"294-313","source":"Crossref","is-referenced-by-count":35,"title":["Polynomial factorization 1987\u20131991"],"prefix":"10.1007","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","volume-title":"Doctoral Thesis","author":"J. A. Abbott","year":"1988","unstructured":"Abbott, J. A., \u201cFactorization of polynomials over algebraic function fields,\u201d Doctoral Thesis, Univ. Bath, England, 1988."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Abbott, J. A., \u201cRecovery of algebraic numbers from their p-adic approximations,\u201d Proc. ACMSIGSAM 1989 Internat. Symp. Symbolic Algebraic Comput., pp. 112\u2013120 (1989).","DOI":"10.1145\/74540.74555"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Abbott, J. A., Bradford, R. J., and Davenport, J. H., \u201cThe Bath algebraic number package,\u201d Proc. 1986 ACM Symp. Symbolic Algebraic Comp., pp. 250\u2013253 (1986).","DOI":"10.1145\/32439.32490"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0167-8396(88)90011-8","volume":"5","author":"S. Abhyankar","year":"1988","unstructured":"Abhyankar, S. and Bajaj, C., \u201cAutomatic rational parameterization of curves and surfaces III: Algebraic plane curves,\u201d Computer Aided Geometric Design 5, pp. 308\u2013321 (1988).","journal-title":"Computer Aided Geometric Design"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Adleman, L. M., Manders, K., and Miller, G. L., \u201cOn taking roots in finite fields,\u201d Proc. 18th IEEE Symp. Foundations Comp. Sci., pp. 175\u2013178 (1977).","DOI":"10.1109\/SFCS.1977.18"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1090\/S0025-5718-1983-0717715-6","volume":"41","author":"L. M. Adleman","year":"1983","unstructured":"Adleman, L. M. and Odlyzko, A. M., \u201cIrreducibility testing and factorization of polynomials,\u201d Math. Comp. 41, pp. 699\u2013709 (1983).","journal-title":"Math. Comp."},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.2307\/1969420","volume":"55\/1","author":"N. C. Ankeny","year":"1952","unstructured":"Ankeny, N. C., \u201cThe least quadratic non residue,\u201d Ann. of Math. 55\/1, pp. 65\u201372 (1952).","journal-title":"Ann. of Math."},{"key":"26_CR8","first-page":"1","volume":"14","author":"A. Arwin","year":"1918","unstructured":"Arwin, A., \u201c\u00dcber die Kongruenzen von dem f\u00fcnften und h\u00f6heren Graden nach einem Primzahlmodulus,\u201d Arkiv f. matematik, astronom. o. fysik 14, pp. 1\u201346 (1918). In German.","journal-title":"Arkiv f. matematik, astronom. o. fysik"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0747-7171(08)80011-9","volume":"9\/3","author":"E. Bach","year":"1990","unstructured":"Bach, E. and Shoup, V., \u201cFactoring polynomials using fewer random bits,\u201d J. Symbolic Comput. 9\/3, pp. 229\u2013239 (1990).","journal-title":"J. Symbolic Comput."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Bajaj, C., Canny, J., Garrity, T., and Warren, J., \u201cFactoring rational polynomials over the complexes,\u201d Proc. ACM-SJGSAM 1989 Internat. Symp. Symbolic Algebraic Comput., pp. 81\u201390 (1989).","DOI":"10.1145\/74540.74551"},{"key":"26_CR11","unstructured":"Batut, C., Bernardi, D., Cohen, H., and Olivier, M., \u201cUser's Guide to PARI-GP,\u201d Manual, February 1991."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., \u201cProbabilistic algorithms in finite fields,\u201d Proc. 22nd IEEE Symp. Foundations Comp. Sci., pp. 394\u2013398 (1981).","DOI":"10.1109\/SFCS.1981.37"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Ben-Or, M. and Tiwari, P., \u201cA deterministic algorithm for sparse multivariate polynomial interpolation,\u201d Proc. 20th Annual ACM Symp. Theory Comp., pp. 301\u2013309 (1988).","DOI":"10.1145\/62212.62241"},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0885-064X(90)90032-9","volume":"6","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M. and Tiwari, P., \u201cSimple algorithms for approximating all roots of a polynomial with real roots,\u201d J. Complexity 6, pp. 417\u2013442 (1990).","journal-title":"J. Complexity"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S. J. Berkowitz","year":"1984","unstructured":"Berkowitz, S. J., \u201cOn computing the determinant in small parallel time using a small number of processors,\u201d Inform. Process. Letters 18, pp. 147\u2013150 (1984).","journal-title":"Inform. Process. Letters"},{"key":"26_CR16","first-page":"18532","volume":"46","author":"E. R. Berlekamp","year":"1967","unstructured":"Berlekamp, E. R., \u201cFactoring polynomials over finite fields,\u201d Bell Systems Tech. J. 46, pp. 18532\u20131859 (1967). Republished in revised form in: E. R. Berlekamp, Algebraic Coding Theory, Chapter 6, McGraw-Hill Publ., New York 1968.","journal-title":"Bell Systems Tech. J."},{"key":"26_CR17","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., \u201cFactoring polynomials over large finite fields,\u201d Math. Comp. 24, pp. 713\u2013735 (1970).","journal-title":"Math. Comp."},{"key":"26_CR18","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1093\/qmath\/5.1.102","volume":"5","author":"M. C. R. Butler","year":"1954","unstructured":"Butler, M. C. R., \u201cOn the reducibility of polynomials over a finite field,\u201d Quart. J. Math., Oxford Ser. (2) 5, pp. 102\u2013107 (1954).","journal-title":"Quart. J. Math., Oxford Ser. (2)"},{"key":"26_CR19","first-page":"55","volume":"12","author":"P. Camion","year":"1982","unstructured":"Camion, P., \u201cUn algorithme de construction des idempotents primitifs d'ideaux d'algebres sur Fq,\u201d Ann. Discrete Math 12, pp. 55\u201363 (1982).","journal-title":"Ann. Discrete Math"},{"key":"26_CR20","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"D. G. Cantor","year":"1981","unstructured":"Cantor, D. G. and Zassenhaus, H., \u201cA new algorithm for factoring polynomials over finite fields,\u201d Math. Comp. 36, pp. 587\u2013592 (1981).","journal-title":"Math. Comp."},{"key":"26_CR21","unstructured":"Chistov, A. L., \u201cThe construction of a finite field in polynomial time,\u201d Proc. 7 All-Union Conf. on Math. Logic (Novosibirsk), p. 196 (1984). In Russian."},{"key":"26_CR22","first-page":"430","volume":"37\/2","author":"A. L. Chistov","year":"1987","unstructured":"Chistov, A. L., \u201cEfficient factorization of polynomials over a local field,\u201d Soviet Math. Doklady (AMS Translation) 37\/2, pp. 430\u2013433 (1987).","journal-title":"Soviet Math. Doklady (AMS Translation)"},{"key":"26_CR23","volume-title":"LOMI Preprints E-5-82","author":"A. L. Chistov","year":"1982","unstructured":"Chistov, A. L. and Grigoryev, D. Yu., \u201cPolynomial-time factoring of multivariable polynomials over a global field,\u201d LOMI Preprints E-5-82, USSR Acad. Sci., Steklov Math. Inst., Leningrad, 1982."},{"key":"26_CR24","volume-title":"LOMI Preprints E-9-83","author":"A. L. Chistov","year":"1983","unstructured":"Chistov, A. L. and Grigoryev, D. Yu., \u201cSubexponential-time solving of systems of algebraic equations I,\u201d LOMI Preprints E-9-83, USSR Acad. Sci., Steklov Math. Inst., Leningrad, 1983."},{"key":"26_CR25","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0004-3702(76)90005-9","volume":"7","author":"B. G. Claybrook","year":"1976","unstructured":"Claybrook, B. G., \u201cA new approach to the symbolic factorization of multivariate polynomials,\u201d Artificial Intelligence 7, pp. 203\u2013241 (1976).","journal-title":"Artificial Intelligence"},{"key":"26_CR26","first-page":"515","volume":"33","author":"G. E. Collins","year":"1975","unstructured":"Collins, G. E., \u201cQuantifier elimination for real closed fields by cylindrical algebraic decomposition,\u201d Proc. 2nd GI Conf. Automata, Theory Formal Lang., Springer Lec. Notes Comp. Sci. 33, pp. 515\u2013532 (1975).","journal-title":"Proc. 2nd GI Conf. Automata, Theory Formal Lang., Springer Lec. Notes Comp. Sci."},{"key":"26_CR27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/B978-0-12-587260-7.50007-8","volume-title":"Mathematical Software III","author":"G. E. Collins","year":"1977","unstructured":"Collins, G. E., \u201cInfallible calculation of polynomial zeros to specified precision,\u201d in Mathematical Software III, edited by J. R. Rice; Academic Press, New York, pp. 35\u201368, 1977."},{"key":"26_CR28","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"Cook, S. A., \u201cA taxonomy of problems with fast parallel algorithms,\u201d Inf. Control 64, pp. 2\u201322 (1985).","journal-title":"Inf. Control"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Davenport, J. H., Gianni, P., and Trager, B. M., \u201cScratchpad's view of algebra II: a categorical view of factorization,\u201d in Proc. 1991 Internat. Symp. Symbolic Algebraic Comput., edited by S. M. Watt; ACM Press, pp. 32\u201338, 1991.","DOI":"10.1145\/120694.120699"},{"key":"26_CR30","unstructured":"Diaz, A., Kaltofen, E., Schmitz, K., and Valente, T., \u201cDSC A System for Distributed Symbolic Computation,\u201d in Proc. 1991 Internat. Symp. Symbolic Algebraic Comput., edited by S. M. Watt; ACM Press, pp. 323\u2013332, 1991."},{"key":"26_CR31","unstructured":"Dicrescenzo, C. and Duval, D., \u201cLe syst\u00e8me D5 de calcul formel avec des nombres alg\u00e9briques,\u201d Chapter 1 of the Doctoral Thesis by D. Duval, Univ. Grenoble, 1987. In French."},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"Duval, D., \u201cAbsolute factorization of polynomials: a geometric approach,\u201d SIAM J. Comput. 20\/1, pp. 1\u201321 (1991).","DOI":"10.1137\/0220001"},{"key":"26_CR33","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-51082-6_79","volume":"356","author":"R. Dvornicich","year":"1987","unstructured":"Dvornicich, R. and Traverso, C., \u201cNewton symmetric functions and the arithmetic of algebraically closed fields,\u201d in Proc. AAECC-5, Springer Lect. Notes Comput. Sci. 356; pp. 216\u2013224, 1987.","journal-title":"Proc. AAECC-5, Springer Lect. Notes Comput. Sci."},{"key":"26_CR34","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/44128.214376","volume":"14\/3","author":"T. S. Freeman","year":"1988","unstructured":"Freeman, T. S., Imirzian, G., Kaltofen, E., and Lakshman Yagati, \u201cDagwood: A system for manipulating polynomials given by straight-line programs,\u201d ACM Trans. Math. Software 14\/3, pp. 218\u2013240 (1988).","journal-title":"ACM Trans. Math. Software"},{"key":"26_CR35","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1098\/rsta.1956.0003","volume":"248","author":"A. Fr\u00f6hlich","year":"1955\/56","unstructured":"Fr\u00f6hlich, A. and Shepherdson, J. C., \u201cEffective procedures in field theory,\u201d Phil. Trans. Roy. Soc., Ser. A 248, pp. 407\u2013432 (1955\/56).","journal-title":"Phil. Trans. Roy. Soc., Ser. A"},{"key":"26_CR36","volume-title":"The Theory of Matrices, Vol. 1","author":"F. R. Gantmacher","year":"1960","unstructured":"Gantmacher, F. R., The Theory of Matrices, Vol. 1; Chelsea Publ. Co., New York, N. Y., 1960."},{"key":"26_CR37","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":"von zur Gathen, J., \u201cHensel and Newton methods in valuation rings,\u201d Math. Comp. 42, pp. 637\u2013661 (1984).","journal-title":"Math. Comp."},{"key":"26_CR38","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(85)90043-1","volume":"31","author":"J. Gathen von zur","year":"1985","unstructured":"von zur Gathen, J., \u201cIrreducibility of multivariate polynomials,\u201d J. Comp. System Sci. 31, pp. 225\u2013264 (1985).","journal-title":"J. Comp. System Sci."},{"key":"26_CR39","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(87)90081-8","volume":"52","author":"J. Gathen von zur","year":"1987","unstructured":"von zur Gathen, J., \u201cFactoring polynomials and primitive elements for special primes,\u201d Theoretical Comput. Sci. 52, pp. 77\u201389 (1987).","journal-title":"Theoretical Comput. Sci."},{"key":"26_CR40","first-page":"281","volume":"8\/3","author":"J. Gathen von zur","year":"1990","unstructured":"von zur Gathen, J., \u201cFunctional decomposition of polynomials: the tame case,\u201d J. Symbolic Comput. 8\/3, pp. 281\u2013299 (1990a).","journal-title":"J. Symbolic Comput."},{"key":"26_CR41","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0747-7171(08)80054-5","volume":"10\/5","author":"J. Gathen von zur","year":"1990","unstructured":"von zur Gathen, J., \u201cFunctional decomposition of polynomials: the wild case,\u201d J. Symbolic Comput. 10\/5, pp. 437\u2013452 (1990b).","journal-title":"J. Symbolic Comput."},{"key":"26_CR42","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J. and Shoup, V., \u201cComputing Frobenius maps and factoring polynomials,\u201d Manuscript, Toronto, November 1991.","DOI":"10.1145\/129712.129722"},{"key":"26_CR43","doi-asserted-by":"crossref","unstructured":"Geddes, K. O., Gonnet, G. H., and Smedley, T. J., \u201cHeuristic methods for operations with algebraic numbers,\u201d in Proc. ISSAC '88, Springer Lec. Notes Comput. Sci. 358, edited by P. Gianni; pp. 475\u2013480, 1988.","DOI":"10.1007\/3-540-51084-2_45"},{"key":"26_CR44","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/0219073","volume":"19\/6","author":"D. Y. Grigoryev","year":"1990","unstructured":"Grigoryev, D. Yu., Karpinski, M., and Singer, M. F., \u201cFast parallel algorithms for sparse multivariate polynomial interpolation over finite fields,\u201d SIAM J. Comput. 19\/6, pp. 1059\u20131063 (1990).","journal-title":"SIAM J. Comput."},{"key":"26_CR45","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-10843-2_2","volume":"115","author":"J. Heintz","year":"1981","unstructured":"Heintz, J. and Sieveking, M., \u201cAbsolute primality of polynomials is decidable in random polynomial-time in the number of variables,\u201d Proc. ICALP '81, Springer Lec. Notes Comp. Sci. 115, pp. 16\u201328 (1981).","journal-title":"Proc. ICALP '81, Springer Lec. Notes Comp. Sci."},{"key":"26_CR46","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0196-6774(91)90014-P","volume":"12\/3","author":"M. A. Huang","year":"1991","unstructured":"Huang, M.-D. A., \u201cGeneralized Riemann hypothesis and factoring polynomials over finite fields,\u201d J. Algorithms 12\/3, pp. 464\u2013481 (1991a).","journal-title":"J. Algorithms"},{"key":"26_CR47","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/0196-6774(91)90015-Q","volume":"12\/3","author":"M. A. Huang","year":"1991","unstructured":"Huang, M.-D. A., \u201cFactorization of polynomials over finite fields and decomposition of primes in algebraic number fields,\u201d J. Algorithms 12\/3, pp. 482\u2013489 (1991b).","journal-title":"J. Algorithms"},{"key":"26_CR48","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., \u201cPolynomial factorization,\u201d in Computer Algebra., 2nd ed., edited by B. Buchberger et al.; Springer Verlag, Vienna, pp. 95\u2013113, 1982.","edition":"2nd ed."},{"key":"26_CR49","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(85)80056-5","volume":"66","author":"E. Kaltofen","year":"1985","unstructured":"Kaltofen, E., \u201cEffective Hilbert irreducibility,\u201d Information and Control 66, pp. 123\u2013137 (1985c).","journal-title":"Information and Control"},{"key":"26_CR50","first-page":"469","volume":"14\/2","author":"E. Kaltofen","year":"1985","unstructured":"Kaltofen, E., \u201cPolynomial-time reductions from multivariate to bi-and univariate integral polynomial factorization,\u201d SJAM J. Comp. 14\/2, pp. 469\u2013489 (1985a).","journal-title":"SJAM J. Comp."},{"key":"26_CR51","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0747-7171(85)80029-8","volume":"1","author":"E. Kaltofen","year":"1985","unstructured":"Kaltofen, E., \u201cFast parallel absolute irreducibility testing,\u201d J. Symbolic Comput. 1, pp. 57\u201367 (1985b). Misprint corrections: J. Symbolic Comput. 9, p. 320 (1989).","journal-title":"J. Symbolic Comput."},{"key":"26_CR52","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0747-7171(87)80055-X","volume":"4","author":"E. Kaltofen","year":"1987","unstructured":"Kaltofen, E., \u201cDeterministic irreducibility testing of polynomials over large finite fields,\u201d J. Symbolic Comp. 4, pp. 77\u201382 (1987).","journal-title":"J. Symbolic Comp."},{"key":"26_CR53","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/42267.45069","volume":"35\/1","author":"E. Kaltofen","year":"1988","unstructured":"Kaltofen, E., \u201cGreatest common divisors of polynomials given by straight-line programs,\u201d J. ACM 35\/1, pp. 231\u2013264 (1988).","journal-title":"J. ACM"},{"key":"26_CR54","first-page":"375","volume-title":"Randomness and Computation, Advances in Computing Research 5","author":"E. Kaltofen","year":"1989","unstructured":"Kaltofen, E., \u201cFactorization of polynomials given by straight-line programs,\u201d in Randomness and Computation, Advances in Computing Research 5, edited by S. Micali; JAI Press, Greenwhich, Connecticut, pp. 375\u2013412, 1989."},{"key":"26_CR55","first-page":"285","volume-title":"Computers in Mathematics, Lecture Notes in Pure and Applied Mathematics 125","author":"E. Kaltofen","year":"1990","unstructured":"Kaltofen, E., \u201cPolynomial Factorization 1982\u20131986,\u201d in Computers in Mathematics, Lecture Notes in Pure and Applied Mathematics 125, edited by D. V. Chudnovsky and R. D. Jenks; Marcel Dekker, Inc., New York, N. Y., pp. 285\u2013309, 1990a."},{"key":"26_CR56","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01810297","volume":"1\/2","author":"E. Kaltofen","year":"1990","unstructured":"Kaltofen, E., \u201cComputing the irreducible real factors and components of an algebraic curve,\u201d Applic. Algebra Engin. Commun. Comput. 1\/2, pp. 135\u2013148 (1990b).","journal-title":"Applic. Algebra Engin. Commun. Comput."},{"key":"26_CR57","volume-title":"Tech. Rep. 91-2","author":"E. Kaltofen","year":"1991","unstructured":"Kaltofen, E., \u201cEffective Noether irreducibility forms and applications,\u201d Tech. Rep. 91-2, Dept. Comput. Sci., Rensselaer Polytech. Inst., Troy, N. Y., January 1991. Extended abstract in Proc. 23rd Ann. ACM Symp. Theory Comput., ACM Press, pp. 54\u201363 (1991)."},{"key":"26_CR58","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-51084-2_44","volume":"358","author":"E. Kaltofen","year":"1988","unstructured":"Kaltofen, E. and Lakshman Yagati, \u201cImproved sparse multivariate polynomial interpolation algorithms,\u201d Proc. ISSAC '88, Springer Lect. Notes Comput. Sci. 358, pp. 467\u2013474 (1988).","journal-title":"Proc. ISSAC '88, Springer Lect. Notes Comput. Sci."},{"key":"26_CR59","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Lakshman Y. N., and Wiley, J. M., \u201cModular rational sparse multivariate polynomial interpolation,\u201d in Proc. 1990 Internat, Symp. Symbolic Algebraic Comput., edited by S. Watanabe and M. Nagata; ACM Press, pp. 135\u2013139, 1990.","DOI":"10.1145\/96877.96912"},{"key":"26_CR60","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0212031","volume":"12\/3","author":"E. Kaltofen","year":"1983","unstructured":"Kaltofen, E., Musser, D. R., and Saunders, B. D., \u201cA generalized class of polynomials that are hard to factor,\u201d SIAM J. Comp. 12\/3, pp. 473\u2013485 (1983).","journal-title":"SIAM J. Comp."},{"key":"26_CR61","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0747-7171(08)80015-6","volume":"9\/3","author":"E. Kaltofen","year":"1990","unstructured":"Kaltofen, E. and Trager, B., \u201cComputing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators,\u201d J. Symbolic Comput. 9\/3, pp. 301\u2013320 (1990).","journal-title":"J. Symbolic Comput."},{"key":"26_CR62","first-page":"150","volume-title":"Number Theory New York Seminar 1989\u20131990","author":"E. Kaltofen","year":"1991","unstructured":"Kaltofen, E. and Yui, N., \u201cExplicit construction of Hilbert class fields of imaginary quadratic fields by integer lattice reduction,\u201d in Number Theory New York Seminar 1989\u20131990, edited by D. V. Chudnovsky, G. V. Chudnovsky, H. Cohn, and M. B. Nathanson; Springer Verlag, New York, pp. 150\u2013202, 1991."},{"key":"26_CR63","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1988-0917831-4","volume":"50","author":"R. Kannan","year":"1988","unstructured":"Kannan, R., Lenstra, A. K., and Lov\u00e1sz, L., \u201cPolynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers,\u201d Math. Comp. 50, pp. 235\u2013250 (1988).","journal-title":"Math. Comp."},{"key":"26_CR64","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF02162564","volume":"8","author":"I. O. Kerner","year":"1966","unstructured":"Kerner, I. O., \u201cEin Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen,\u201d Numer. Math. 8, pp. 290\u2013294 (1966). In German.","journal-title":"Numer. Math."},{"key":"26_CR65","volume-title":"The Art of Programming, Vol. 2, Semi-Numerical Algorithms, Ed. 2","author":"D. E. Knuth","year":"1981","unstructured":"Knuth, D. E., The Art of Programming, Vol. 2, Semi-Numerical Algorithms, Ed. 2; Addison Wesley, Reading, MA, 1981."},{"key":"26_CR66","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0747-7171(89)80027-6","volume":"7\/5","author":"D. Kozen","year":"1989","unstructured":"Kozen, D. and Landau, S., \u201cPolynomial decomposition algorithms,\u201d J. Symbolic Comp. 7\/5, pp. 445\u2013456 (1989).","journal-title":"J. Symbolic Comp."},{"key":"26_CR67","first-page":"1","volume":"92","author":"L. Kronecker","year":"1882","unstructured":"Kronecker, L., \u201cGrundz\u00fcge einer arithmetischen Theorie der algebraischen Grossen,\u201d J. reine angew. Math. 92, pp. 1\u2013122 (1882).","journal-title":"J. reine angew. Math."},{"key":"26_CR68","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0214015","volume":"14","author":"S. Landau","year":"1985","unstructured":"Landau, S., \u201cFactoring polynomials over algebraic number fields,\u201d SIAM J. Comp. 14, pp. 184\u2013195 (1985). Erratum: SIAM J. Comput. 20\/5, p. 998 (1991).","journal-title":"SIAM J. Comp."},{"key":"26_CR69","doi-asserted-by":"crossref","unstructured":"Landau, S., \u201cSimplification of nested radicals,\u201d Proc. 30th Annual Symp. Foundations of Comp. Sci., pp. 314\u2013319 (1989).","DOI":"10.1109\/SFCS.1989.63496"},{"key":"26_CR70","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(85)90013-3","volume":"30","author":"S. Landau","year":"1985","unstructured":"Landau, S. and Miller, G. L., \u201cSolvability by radicals,\u201d J. Comp. System Sci. 30, pp. 179\u2013208 (1985).","journal-title":"J. Comp. System Sci."},{"key":"26_CR71","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-12868-9_108","volume":"162","author":"A. K. Lenstra","year":"1983","unstructured":"Lenstra, A. K., \u201cFactoring polynomials over algebraic number fields,\u201d Proc. EUROCAL '83, Springer Lec. Notes Comp. Sci. 162, pp. 245\u2013254 (1983).","journal-title":"Proc. EUROCAL '83, Springer Lec. Notes Comp. Sci."},{"key":"26_CR72","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1137\/0216040","volume":"16","author":"A. K. Lenstra","year":"1987","unstructured":"Lenstra, A. K., \u201cFactoring multivariate polynomials over algebraic number fields,\u201d SIAM J. Comp. 16, pp. 591\u2013598 (1987).","journal-title":"SIAM J. Comp."},{"key":"26_CR73","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., and Lov\u00e1sz, L., \u201cFactoring polynomials with rational coefficients,\u201d Math. Ann. 261, pp. 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"26_CR74","volume-title":"Tech. Report TR-90-052","author":"T. M. Lickteig","year":"1990","unstructured":"Lickteig, T. M., \u201cOn semialgebraic decision complexity,\u201d Tech. Report TR-90-052, Internat. Computer Sci. Inst., Berkeley, California, September 1990. Habilitationsschrift."},{"key":"26_CR75","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R. and Niederreiter, H., Finite Fields; Addison-Wesley, Reading, MA, 1983."},{"key":"26_CR76","volume-title":"Manuscript","author":"D. A. Linwood","year":"1990","unstructured":"Linwood, D. A., \u201cRoots of a polynomial via a parallel Newton's method,\u201d Manuscript, Dept. Math., California State University, Fresno, CA, July 1990."},{"key":"26_CR77","doi-asserted-by":"crossref","unstructured":"Lipton, R. and Stockmeyer, L., \u201cEvaluations of polynomials with superpreconditioning,\u201d Proc. 8th ACM Symp. Theory Comp., pp. 174\u2013180 (1976).","DOI":"10.1145\/800113.803645"},{"key":"26_CR78","volume-title":"Th\u00e8se Doctorat","author":"H. Lombardi","year":"1989","unstructured":"Lombardi, H., \u201cAlgebre elementaire en temps polynomial,\u201d Th\u00e8se Doctorat, Universit\u00e9 de Franche-Comt\u00e9, Besan\u00e7on, France, June 1989. In French."},{"key":"26_CR79","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-7091-3406-1_12","volume-title":"Computer Algebra","author":"R. Loos","year":"1982","unstructured":"Loos, R., \u201cComputing in algebraic extensions,\u201d in Computer Algebra, 2nd ed., edited by B. Buchberger et al.; Springer Verlag, Vienna, pp. 173\u2013187, 1982.","edition":"2nd ed."},{"key":"26_CR80","doi-asserted-by":"crossref","unstructured":"Lucks, M., \u201cA fast implementation of polynomial factorization,\u201d Proc. 1986 ACM Symp. Symbolic Algebraic Comp., pp. 228\u2013232 (1986).","DOI":"10.1145\/32439.32485"},{"key":"26_CR81","volume-title":"The geometry of the zeros of a polynomial in a complex variable; Math. Surveys 3","author":"M. Marden","year":"1949","unstructured":"Marden, M., The geometry of the zeros of a polynomial in a complex variable; Math. Surveys 3; AMS, Providence, R.I., 1949."},{"key":"26_CR82","volume-title":"Tech. Report SC 88-2","author":"H. Melenk","year":"1988","unstructured":"Melenk, H., M\u00f6ller, H. M., and Neun, W., \u201cOn Gr\u00f6bner bases computation on a supercomputer using REDUCE,\u201d Tech. Report SC 88-2, K. Zuse Zentrum Berlin, January 1988."},{"key":"26_CR83","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-51084-2_24","volume":"358","author":"A. J. Menezes","year":"1988","unstructured":"Menezes, A. J., van Oorschot, P. C., and Vanstone, S. A., \u201cSome computational aspects of root finding in GF(q m ),\u201d Proc. JSSAC '88, Springer Lec. Notes Comput. Sci. 358, pp. 259\u2013270 (1988).","journal-title":"Proc. JSSAC '88, Springer Lec. Notes Comput. Sci."},{"key":"26_CR84","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1977-0422193-8","volume":"31","author":"R. T. Moenck","year":"1977","unstructured":"Moenck, R. T., \u201cOn the efficiency of algorithms for polynomial factoring,\u201d Math. Comp. 31, pp. 235\u2013250 (1977).","journal-title":"Math. Comp."},{"key":"26_CR85","unstructured":"Monagan, M. B., \u201cA heuristic irreducibility test for univariate polynomials,\u201d Manuscript, Waterloo, Ontario, 1986. J. Symbolic Comput., to appear."},{"key":"26_CR86","doi-asserted-by":"crossref","unstructured":"Moore, P. M. A. and Norman, A. C., \u201cImplementing a polynomial factorization problem,\u201d Proc. 1981 ACM Symp. Symbolic Algebraic Comp., pp. 109\u2013116 (1981).","DOI":"10.1145\/800206.806379"},{"key":"26_CR87","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/321879.321890","volume":"22","author":"D. R. Musser","year":"1975","unstructured":"Musser, D. R., \u201cMultivariate polynomial factorization,\u201d J. ACM 22, pp. 291\u2013308 (1975).","journal-title":"J. ACM"},{"key":"26_CR88","doi-asserted-by":"crossref","unstructured":"Neff, C. A., \u201cSpecified precision polynomial root isolation is in NC,\u201d Proc. 31st Annual Symp. Foundations Computer Sci., pp. 152\u2013162 (1990).","DOI":"10.1109\/FSCS.1990.89534"},{"key":"26_CR89","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01449599","volume":"85","author":"E. Noether","year":"1922","unstructured":"Noether, E., \u201cEin algebraisches Kriterium f\u00fcr absolute Irreduzibilit\u00e4t,\u201d Math. Ann. 85, pp. 26\u201333 (1922).","journal-title":"Math. Ann."},{"key":"26_CR90","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/S0025-5718-1985-0771036-6","volume":"44","author":"L. Pasquini","year":"1985","unstructured":"Pasquini, L. and Trigiante, D., \u201cA globally convergent method for simultaneously finding polynomial roots,\u201d Math. Comput. 44, pp. 135\u2013149 (1985).","journal-title":"Math. Comput."},{"key":"26_CR91","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/355705.355710","volume":"2\/4","author":"J. R. Pinkert","year":"1976","unstructured":"Pinkert, J. R., \u201cAn exact method for finding roots of a complex polynomial,\u201d ACM Trans. Math. Software 2\/4, pp. 351\u2013363 (1976).","journal-title":"ACM Trans. Math. Software"},{"key":"26_CR92","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/S0022-0000(77)80013-5","volume":"14","author":"D. A. Plaisted","year":"1977","unstructured":"Plaisted, D. A., \u201cSparse complex polynomials and polynomial reducibility,\u201d J. Comp. System Sci. 14, pp. 210\u2013221 (1977).","journal-title":"J. Comp. System Sci."},{"key":"26_CR93","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. O. Rabin","year":"1980","unstructured":"Rabin, M. O., \u201cProbabilistic algorithms in finite fields,\u201d SIAM J. Comp. 9, pp. 273\u2013280 (1980).","journal-title":"SIAM J. Comp."},{"key":"26_CR94","doi-asserted-by":"crossref","unstructured":"R\u00f3nyai, L., \u201cGalois groups and factoring polynomials over finite fields,\u201d Proc. 30th Annual Symp. Foundations of Comp. Sci., pp. 99\u2013104 (1989).","DOI":"10.1109\/SFCS.1989.63462"},{"key":"26_CR95","volume-title":"Springer Lect. Notes Math. 536","author":"W. M. Schmidt","year":"1976","unstructured":"Schmidt, W. M., Equations over finite fields. An elementary approach; Springer Lect. Notes Math. 536; Springer Verlag, New York, N. Y., 1976."},{"key":"26_CR96","first-page":"483","volume":"44","author":"R. J. Schoof","year":"1985","unstructured":"Schoof, R. J., \u201cElliptic curves over finite fields and the computation of square roots mod p,\u201d Math. Comp. 44, pp. 483\u2013494 (1985).","journal-title":"Math. Comp."},{"key":"26_CR97","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1093\/qmath\/7.1.110","volume":"7","author":"\u0160. Schwarz","year":"1956","unstructured":"Schwarz, \u0160., \u201cOn the reducibility of polynomials over a finite field,\u201d Quart. J. Math. Oxford Ser. (2) 7, pp. 110\u2013124 (1956).","journal-title":"Quart. J. Math. Oxford Ser. (2)"},{"key":"26_CR98","unstructured":"Sch\u00f6nhage, A., \u201cThe fundamental theorem of algebra in terms of computational complexity,\u201d Tech. Report, Univ. T\u00fcbingen, 1982."},{"key":"26_CR99","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/3-540-13345-3_40","volume":"172","author":"A. Sch\u00f6nhage","year":"1984","unstructured":"Sch\u00f6nhage, A., \u201cFactorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm,\u201d Proc. ICALP '84, Springer Lec. Notes Comp. Sci. 172, pp. 436\u2013447 (1984).","journal-title":"Proc. ICALP '84, Springer Lec. Notes Comp. Sci."},{"key":"26_CR100","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1090\/S0025-5718-1990-0993933-0","volume":"54\/189","author":"V. Shoup","year":"1990","unstructured":"Shoup, V., \u201cNew algorithms for finding irreducible polynomials over finite fields,\u201d Math. Comput. 54\/189, pp. 435\u2013447 (1990a).","journal-title":"Math. Comput."},{"key":"26_CR101","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(90)90195-4","volume":"33","author":"V. Shoup","year":"1990","unstructured":"Shoup, V., \u201cOn the deterministic complexity of factoring polynomials over finite fields,\u201d Inform. Process. Letters 33, pp. 261\u2013267 (1990b).","journal-title":"Inform. Process. Letters"},{"key":"26_CR102","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(91)90212-Z","volume":"38","author":"V. Shoup","year":"1991","unstructured":"Shoup, V., \u201cSmoothness and factoring polynomials over finite fields,\u201d Inform. Process. Letters 38, pp. 39\u201342 (1991a).","journal-title":"Inform. Process. Letters"},{"key":"26_CR103","doi-asserted-by":"crossref","unstructured":"Shoup, V., \u201cA fast deterministic algorithm for factoring polynomials over finite fields of small characteristic,\u201d in Proc. 1991 Internat. Symp. Symbolic Algebraic Comput., edited by S. M. Watt; ACM Press, pp. 14\u201321, 1991b.","DOI":"10.1145\/120694.120697"},{"key":"26_CR104","unstructured":"Shparlinskiy, I. E., \u201cOn some problems of theory of finite fields,\u201d Manuscript, Moscow, August 1990."},{"key":"26_CR105","unstructured":"Smedley, T. J., \u201cFast methods for computation with algebraic numbers,\u201d Ph. D. Thesis, Dept. Comput. Sci., Univ. Waterloo, 1989."},{"key":"26_CR106","first-page":"26","volume":"340","author":"V. G. Sprind\u017euk","year":"1983","unstructured":"Sprind\u017euk, V. G., \u201cArithmetic specializations in polynomials,\u201d J. reine angew. Math. 340, pp. 26\u201352 (1983).","journal-title":"J. reine angew. Math."},{"key":"26_CR107","first-page":"633","volume-title":"Handbook of Theoretical Computer Science, Algorithms and Complexity (Volume A)","author":"V. Strassen","year":"1990","unstructured":"Strassen, V., \u201cAlgebraic complexity theory,\u201d in Handbook of Theoretical Computer Science, Algorithms and Complexity (Volume A), edited by J. van Leeuwen; Elsevier Science Publ., Amsterdam, pp. 633\u2013672, 1990."},{"key":"26_CR108","first-page":"337","volume":"10","author":"A. Thiong ly","year":"1989","unstructured":"Thiong ly, A., \u201cA deterministic algorithm for factorizing polynomials over extensions GF(p m ), p a small prime,\u201d J. Inform. Optim. Sci. 10, pp. 337\u2013344 (1989).","journal-title":"J. Inform. Optim. Sci."},{"key":"26_CR109","unstructured":"Tonelli, A., \u201cBemerkung \u00fcber die Aufl\u00f6sung quadratischer Congruenzen,\u201d Nachrichten d. Akademie d. Wissenschaften in G\u00f6ttingen, pp. 344\u2013346 (1891). In German."},{"key":"26_CR110","doi-asserted-by":"crossref","unstructured":"Trager, B. M., \u201cAlgebraic factoring and rational function integration,\u201d Proc. 1976 ACM Symp. Symbolic Algebraic Comp., pp. 219\u2013228 (1976).","DOI":"10.1145\/800205.806338"},{"key":"26_CR111","doi-asserted-by":"crossref","unstructured":"Trevison, V. and Wang, P., \u201cPractical factorization of univariate polynomials over finite fields,\u201d in Proc. 1991 Internat. Symp. Symbolic Algebraic Comput., edited by S. M. Watt; ACM Press, pp. 22\u201331, 1991.","DOI":"10.1145\/120694.120698"},{"key":"26_CR112","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/1089302.1089307","volume":"16\/3","author":"H. F. Trotter","year":"1982","unstructured":"Trotter, H. F., \u201cStatistics on factoring polynomials mod p and p-adically,\u201d SIGSAM Bulletin 16\/3, pp. 24\u201329 (1982).","journal-title":"SIGSAM Bulletin"},{"key":"26_CR113","volume-title":"Manuscript","author":"G. Viry","year":"1990","unstructured":"Viry, G., \u201cFactorization of multivariate polynomials with coefficients in Fp,\u201d Manuscript, Univ. Niamey, Niamey, Niger (West Africa), November 1990. J. Symbolic Comput., to appear."},{"key":"26_CR114","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1007\/BF01782374","volume":"102","author":"B. L. Waerden van der","year":"1930","unstructured":"van der Waerden, B. L., \u201cEine Bemerkung \u00fcber die Unzerlegbarkeit von Polynomen,\u201d Math. Ann. 102, pp. 738\u2013739 (1930). In German.","journal-title":"Math. Ann."},{"key":"26_CR115","volume-title":"Moderne Algebra","author":"B. L. Waerden van der","year":"1940","unstructured":"van der Waerden, B. L., Moderne Algebra; Springer Verlag, Berlin, 1940. English transl. publ. under the title \u201cModern algebra\u201d by F. Ungar Publ. Co., New York, 1953"},{"key":"26_CR116","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1090\/S0025-5718-1978-0568284-3","volume":"32","author":"P. S. Wang","year":"1978","unstructured":"Wang, P. S., \u201cAn improved multivariate polynomial factorization algorithm,\u201d Math. Comp. 32, pp. 1215\u20131231 (1978).","journal-title":"Math. Comp."},{"key":"26_CR117","doi-asserted-by":"crossref","unstructured":"Wang, P. S., \u201cParallel univariate polynomial factorization on shared-memory multiprocessors,\u201d in Proc. 1990 Internat. Symp. Symbolic Algebraic Comput., edited by S. Watanabe and M. Nagata; ACM Press, pp. 145\u2013151, 1990.","DOI":"10.1145\/96877.96915"},{"key":"26_CR118","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/355705.355709","volume":"2","author":"P. J. Weinberger","year":"1976","unstructured":"Weinberger, P. J. and Rothschild, L. P., \u201cFactoring polynomials over algebraic number fields,\u201d ACM Trans. Math. Software 2, pp. 335\u2013350 (1976).","journal-title":"ACM Trans. Math. Software"},{"key":"26_CR119","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"IT-32","author":"D. Wiedemann","year":"1986","unstructured":"Wiedemann, D., \u201cSolving sparse linear equations over finite fields,\u201d IEEE Trans. Inf. Theory IT-32, pp. 54\u201362 (1986).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"26_CR120","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322077.322084","volume":"25\/3","author":"H. S. Wilf","year":"1978","unstructured":"Wilf, H. S., \u201cA global bisection algorithm for computing the zeros of polynomials in the complex plane,\u201d J. ACM 25\/3, pp. 415\u2013420 (1978).","journal-title":"J. ACM"},{"key":"26_CR121","doi-asserted-by":"crossref","unstructured":"Yokoyama, K., Noro, M., and Takeshima, T., \u201cOn factoring multi-variate polynomials over algebraically closed fields,\u201d in Proc. 1991 Internat. Symp. Symbolic Algebraic Comput., edited by S. M. Watt; ACM Press, p. 297, 1990.","DOI":"10.1145\/96877.96966"},{"key":"26_CR122","volume-title":"Ph.D. Thesis, M.I.T., 1974. Reprint","author":"D. Y. Y. Yun","year":"1980","unstructured":"Yun, D. Y. Y., \u201cThe Hensel lemma in algebraic manipulation,\u201d Ph.D. Thesis, M.I.T., 1974. Reprint: Garland Publ., New York 1980."},{"key":"26_CR123","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0022-314X(69)90047-X","volume":"1","author":"H. Zassenhaus","year":"1969","unstructured":"Zassenhaus, H., \u201cOn Hensel factorization I,\u201d J. Number Theory 1, pp. 291\u2013311 (1969).","journal-title":"J. Number Theory"},{"key":"26_CR124","first-page":"499","volume":"15","author":"H. Zassenhaus","year":"1975","unstructured":"Zassenhaus, H., \u201cOn Hensel factorization II,\u201d in Instituto Nazionale di Alta Mat., Symposia Mathematica 15; pp. 499\u2013513, 1975.","journal-title":"Instituto Nazionale di Alta Mat., Symposia Mathematica"},{"key":"26_CR125","first-page":"6","volume":"15\/2","author":"H. Zassenhaus","year":"1981","unstructured":"Zassenhaus, H., \u201cPolynomial time factoring of integral polynomials,\u201d SIGSAM Bulletin 15\/2, pp. 6\u20137 (1981).","journal-title":"SIGSAM Bulletin"},{"key":"26_CR126","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume":"72","author":"R. Zippel","year":"1979","unstructured":"Zippel, R., \u201cProbabilistic algorithms for sparse polynomials,\u201d Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci. 72, pp. 216\u2013226 (1979).","journal-title":"Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci."},{"key":"26_CR127","doi-asserted-by":"crossref","unstructured":"Zippel, R., \u201cNewton's iteration and the sparse Hensel algorithm,\u201d Proc. '81 ACM Symp. Symbolic Algebraic Comp., pp. 68\u201372 (1981).","DOI":"10.1145\/800206.806372"},{"key":"26_CR128","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0747-7171(08)80018-1","volume":"9\/3","author":"R. Zippel","year":"1990","unstructured":"Zippel, R., \u201cInterpolating polynomials from their values,\u201d J. Symbolic Comput. 9\/3, pp. 375\u2013403 (1990).","journal-title":"J. Symbolic Comput."},{"key":"26_CR129","doi-asserted-by":"crossref","unstructured":"Zippel, R., \u201cRational function decomposition,\u201d in Proc. 1991 Internat. Symp. Symbolic Algebraic Comput., edited by S. M. Watt; ACM Press, pp. 1\u20136, 1991.","DOI":"10.1145\/120694.120695"}],"container-title":["Lecture Notes in Computer Science","LATIN '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:29:30Z","timestamp":1586568570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552847"],"references-count":129,"URL":"https:\/\/doi.org\/10.1007\/bfb0023837","relation":{},"subject":[]}}