L. Adleman and H. Lenstra, Finding irreducible polynomials over finite fields, in: Proc. 18th Annual ACM Symp. on Theory of Computing (1986) 350--355.
L.M. Adleman and A.M. Odlyzko, Irreducibility testing and factorization of polynomials, in: Proc. 22nd IEEE Symp. Foundations of Computer Science (1981) 409--418.
L.M. Adleman, K. Mander and G. Miller, On taking roots in finite fields, in: Proc. 18th IEEE Symp. Foundations of Computer Science (1977) 175--178.
L.M. Adleman, K. Manders and G. Miller, On taking roots in finite fields, in: Proc. 18th Annual Symp. on Foundations of Computer Science, IEEE Computer Society, Providence, RI (1977) 175--178.
S. Agou, Factorization sur un corps fini Fpn des polynômes composés f(Xs) lorsque f(X) est un polynôme irréductible de Fpn[X], Enseign. Math. 22 (1976) 305--312.
S. Agou, Critères d'irreductibilité des polynômes composeés à coefficients sur un corps fini, Acta Arith. 30 (1976) 213--223.
S. Agou, Irreductibilité sur un corps fini Fps des polynômes f(Xpr-aX), J. Reine Angew. Math. 292 (1977) 191--195.
S. Agou, Irreductibilité des polynômes f(∑i=0m aiXpi) sur un corp fini Fpi, Canad. Math. Bull. 23 (1980) 207--212.
S. Agou, Irreductibilité des polynômes f(Xp2r-aXpr-bX) sur un corps fini Fps, J. Number Theory 11 (1) (1979) 20.
S. Agou, Irreductibilité des polynômes f(xp2r- axpr-bx) sur un corp fini Fpr, J. Number Theory 10 (1978) 64--69.
S. Agou, Factorization sur un corp fini Fpn des polynômes composes F(xpn-ax), lorsque f(x) est un polynôme irreductible de Fpn[X], J. Number Theory 9 (1977) 229--239.
A.G. Akritas, A simple proof of the validity of the reduced prs algorithm, Computing 38 (1987) 369--372.
A.G. Akritas, A new method for computing polynomial greatest common divisors and remainder sequences, Numer. Math. 52 (1988) 119--127.
A.G. Akritas, A correction on a theorem by Uspensky, Bull. Greek Math. Soc. 19 (1978) 278--285.
A.G. Akritas, Exact algorithms for polynomial real root approximation using continued fractions, Computing 30 (1983) 63--76.
A.G. Akritas, Vincent's forgotten theorem, its extension and application, Comput. Math. Appl. 7 (1981) 309--317.
W.A. Al-Salam, Some functions related to the Bessel polynomials, Duke Math. J. 26 (1959) 519--539.
A.A. Albert, On certain trinomial equations in finite fields, Ann. of Math. 66 (1957) 170--178.
A.A. Albert, Fundamental Concepts of Higher Algebra (Univ. Chicago Press, Chicago, IL, 1956).
H.L. Albert, Modern Higher Algebra (McGraw-Hill, New York, 1968) 156--165; 183--186; 191.
N.C. Ankeny and C.A. Rogers, A conjecture of Chowla, Ann. of Math. 53 (1951) 541--550.
J.W. Archbold, Algebra (Pitman, London, 3rd ed., 1964) 122--133; 174--207.
Stäckel, Arithmetische Eigenschaften ganzer Funktionen, J. Reine Angew. Math. 148 (1918) 101--112.
E. Bach, Number Theoretic Algorithms, in: Annual Reviews of Computer Science 4 (1990) 141--145.
E. Bach, A note on square roots in finite fields, IEEE Trans. Inform. Theory 36 (1990) 1494--1498.
E.J. Barbeau, Polynomials (Springer, New York, 1989).
M. Bauer, Ganzzahlige Gleichungen ohne Affect, Math. Ann. 64 (1907) 325--327.
M. Bauer, Elementare Irreduzibilitätsuntersuchungen, J. Reine Angew. Math. 134 (1908) 15--22.
M. Bauer, Beitrag zur Theorie der irreduziblen Gleichungen, J. Reine Angew. Math. 128 (1905) 298--301.
M. Bauer, Zur Theorie der algebraischen Zahlkörper, Math. Ann. 77 (1916) 353--356.
M. Bauer, Zur allgemeinen Theorie der algebraischen Grössen, J. Reine Angew. Math. 132 (1907) 21--32.
M. Bauer, Über Gleichungen ohne Affekt, J. Reine Angew. Math. 132 (1907) 33--35.
M. Bauer, Verallgemeinerung eines Satzes von Schönemann, J. Reine Angew. Math. 128 (1905) 87--89.
M. Bauer, Über einen Satz von Kronecker, Arch. Math. Phys. 6 (1903) 218--219.
J.T.B. Beard, Computing in GF(q), Math. Comp. 28 (1974) 1159--1166.
J.T.B. Beard and K.I. West, Some primitive polynomials of the third kind, Math. Comp. 28 (1974) 1166--1167.
M. Ben-Or, Probabilistic algorithms in finite fields, in: Proc. 22nd Symp. on Foundations of Computer Science (IEEE Press, New York, 1981) 394--398.
E.R. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. 24 (1970) 713--735.
E.R. Berlekamp, H. Ramsey and G. Solomon, On the solution of algebraic equation over finite field, Inform. and Control 10 (1967) 553--564.
E.R. Berlekamp, Algebraic Coding Theory (McGraw-Hill, New York, 1968).
E.R. Berlekamp, Factoring polynomials, in: Proc. Third Southeastern Conf. on Combinatorics, Graph Theory, and Computing (Utilitas Math., Winnipeg, 1972) 1--7.
D.E. Betti, Sopra la risolubilita per radicali delle equazioni algebraiche irriduttibili di grado primo, Annali di Scienze Matematiche e Fisiche 2 (1851) 5; 3 (1852) 49.
D. Bini and V. Pan, Polynomial division and its computational complexity, J. Complexity 2 (1986) 179--203.
B.J. Birch and H.P.F. Swinnerton-Dyer, Note on a problem of Chowla, Acta. Arith. 5 (1959) 417--423.
G. Birkhoff and S. MacLane, A Survey of Modern Algebra (Macmillan, New York, 3rd ed., 1965).
I. Blake et al., Applications of Finite Fields (Kluwer Academic, Boston, MA, 1993).
E. Bombieri and H. Davenport, On two problems of Mordell, Amer. J. Math. 88 (1966) 61--70.
K.H.V. Booth, An investigation into the real roots of certain polynomials, Math. Tables Aids Comput. 8 (1954) 184--186.
A. Borodin and I. Munro, The Computational Complexity of Algebraic and Numerical Problems (Elsevier, New York, 1977) 54--76; 132--137; 148--150.
S. Borofsky, Elementary Theory of Equations (Macmillan, New York, 1950).
D.W. Boyd, Reciprocal polynomials having small measure, Math. Comp. 35 (1980) 1361--1377; II, ibid. 53 (1989) 355--357; S1--S5.
D.W. Boyd, Variations on a theme of Kronecker, Canad. Math. Bull. 21 (2) (1978) 129--133.
R. Brandl, Integer polynomials that are reducible modulo all primes, Amer. Math. Monthly 93 (1986) 286--288.
A. Brauer and G. Ehrlich, On the irreducibility of certain polynomials, Bull. Amer. Math. Soc. 52 (1946) 844--856.
A. Brauer, On algebraic equations with all but one root in the interior of the unit circle, Math. Nachr. 4 (1951) 250--257.
A. Brauer, Bemurkungen zu einem Satz von Herrn G. Polya, Jahresber. Deutsch. Math.-Verein. 43 (1933) 124--129.
A. Brauer, On the irreducibility of polynomials with large third coefficients, Amer. J. Math. 70 (1948) 423--432.
A. Brauer, R. Brauer and H. Hopf, Über die Irreduzibilität einiger spezieller Klassen von Polynomen, Jahresber. Deutsch. Math.-Verein. 35 (1926) 99--112.
A. Brauer and R. Brauer, Über Irreduzibilitätskriterien von I. Schur und G. Pólya, Math. Z. 40 (1936) 242--265.
R.P. Brent, On computing factors of cyclotomic polynomials, Math. Comp. 61 (1993) 131--149.
J. Brillhart, On the Euler and Bernoulli polynomials, J. Reine Angew. Math. 234 (1969) 45--64.
D. Broline, Renumbering the faces of dice, Math. Mag. 52 (1979) 312--315.
W.S. Brown, Reducibility properties of polynomials over the rationals, Amer. Math. Monthly 70 (1963) 965--969.
W.S. Brown and R.L. Graham, An irreducibility criterion for polynomials over the integers, Amer. Math. Monthly 76 (1969) 795--797.
A.A. Bruen, C.U. Jensen and N. Yui, Polynomials with Frobenius groups of prime degree as Galois groups II, J. Number Theory 24 (1986) 305--359.
W.S. Burnside and A.W. Panton, Theory of Equations, 1 (Dover, New York, 1960) 165--167.
W.S. Burnside and A.W. Panton, Theory of Equations, 2 (Dover, New York, 1960) 274--305.
M.C.R. Butler, The irreducible factors of f(Xm) over a finite field, J. London Math. Soc. 30 (1955) 480--482.
M.C.R. Butler, On the reducibility of polynomials over a finite field, Quart. J. Math. Oxford 5 (1954) 102--107.
J. Calmet and R. Loos, An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p), Inform. Process. Lett. 11 (2) (1980) 94--95.
J. Calmet and R. Loos, Deterministic versus probabilistic factorization of integral polynomials, in: J. Calmet, Ed., Computer Algebra (EUROCAM 82) (Springer, New York, 1982) 117--125.
J. Calmet, Algebraic algorithms in GF(q), Discrete Math. 56 (2/3} (1985) 101--109.
P. Camion, Factorization des polynômes de Fq[X], Revue du Cethedec, N.S. 812 (1981).
P. Camion, A deterministic algorithm for factorizing polynomials of Fq[x], in: C. Berge, D. Bresson, P. Camion, J.F. Maurras and F. Sterboul, Eds., Combinatorial Mathematics, North-Holland Math. Stud. 75, Ann. Discrete Math. 17 (North-Holland, Amsterdam, 1983).
P. Camion, Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials, IEEE Trans. Inform. Theory 29 (1983) 378--385.
P. Camion, Factoring polynomials over an extension field, in: Proc. 1987 Conf. on Information Science and Systems (John Hopkins University, Baltimore, MD, 1987) 581.
P. Camion, A deterministic algorithm for factoring polynomials of Fq[x], Ann. Discrete Math. 17 (1983) 149--157.
D. Cantor, On arithmetical algorithms over finite fields, J. Combinatorial Theory A 50 (1989) 285--300.
D.C. Cantor and E.D. Strauss, On the conjecture of D.H. Lehmer, Acta Arith. 42 (1982) 97--100.
D.G. Cantor, Irreducible polynomials with integral coefficients have succinct certificates, J. Algorithms 2 (1981) 385--392.
D.G. Cantor, P.H. Galyean and H.G. Zimmer, A continued fraction algorithm for real algebraic numbers, Math. Comp. 26 (1972) 785--791.
D.G. Cantor and H. Zassenhaus, A new algorithm for factoring polynomials over finite fields, Math. Comp. 36 (1981) 587--592.
M. Car, Factorisation dans Fq[X], C.R. Acad. Sci. Paris Ser. I 294 (1982) 147--150.
L. Carlitz, A theorem of Stickelberger, Math. Scand. 1 (1953) 82--84.
L. Carlitz, Factorization of a special polynomial over a finite field, Pacific J. Math. 32 (1970) 603--614.
L. Carlitz, Note on a quartic congruence, Amer. Math. Monthly 63 (1956) 569--571.
L. Carlitz, Note on irreducibility of the Bernoulli and Euler polynomials, Duke Math. J. 19 (1952) 475--481.
R.D. Carmichael, On the numerical factors of the forms αn ± βn, Ann. of Math. (2) 15 (1913) 30--70.
C.E. Carroll, Polynomials all of whose derivatives have integer roots, Amer. Math. Monthly 96 (1989) 129--130.
J.W.S. Cassels, On a problem of Schinzel and Zassenhaus, J. Math. Sci. 1 (1966) 1--8.
B.F. Caviness and M. Rothstein, A modular greatest common divisor algorithm for Gaussian polynomials, in: ACM '75 Conf. Proc. (1975) 270--273.
B.F. Caviness, Computer Algebra: Past and Future, Eurocal 85 (Springer, New York, 1985) 1--18.
L. Cerlienco, M. Mignotte and F. Piras, Computing the measure of a polynomial, J. Symbolic Comput. 4 (1987) 21--34.
C. Chamfy, Valeur minimal du module pour un ensemble fermé d'indices algébriques, C.R. Acad. Sci. Paris 244 (1957) 1992--1994.
B.W. Char, K.O. Geddes and G.H. Gonnet, GCDHEU: heuristic polynomial GCD algorithm based on integer GCD computation, in: J. Fitch, Ed., EUROSAM 84, Lecture Notes in Comput. Sci. 174 (Springer, New York, 1984) 285--296.
C.L. Chen, Formulas for the solutions of quadratic equations over GF(2m), IEEE Trans. Inform. Theory 28 (1982) 792--794.
R.T. Chien, B.E. Cunningham and I.B. Oldham, Hybrid methods for finding roots of a polynomial with application to BCH decoding, IEEE Trans. Inform. Theory 15 (1969) 329--335.
R.T. Chien and A. Moy, Polynomial root computation with a stored table, in: Proc. 5th Annual Princeton Conf. on Information Science and Systems (1971) 374--377.
S. Chowla, A note on the construction of finite Galois fields GF(pn), J. Math. Anal. Appl. 15 (1966) 53--54.
R. Church, Tables of irreducible polynomials for the first four prime moduli, Ann. of Math. 36 (1935) 198--209.
A. Clark, Elements of Abstract Algebra (Wadsworth, Belmont, CA, 1971).
G.E. Collins, Computer algebra of polynomials and rational functions, Amer. Math. Monthly 80 (1973) 725--755.
G.E. Collins, Infallible calculation of polynomial zeros to specified precision, in: Mathematical Software III (Academic Press, New York, 1977) 35--68.
G.E. Collins, Computing Time Analyses for Some Arithmetic and Algorithms, in: R.G. Tobey, Ed., Proc. 1968 Summer Institute on Symbolic Mathematical Computation, 195--231.
G.E. Collins, Factoring univariate integral polynomials in polynomial average time, in: E.W. Ng, Ed., Symbolic and Algebraic Computation, Lecture Notes in Comput. Sci. 72 (Springer, New York, 1979) 317--329.
G.E. Collins, High precision calculation of real algebraic numbers, SIGSAM Bull. 8 (4) (1974) (abstract).
G.E. Collins, D.R. Musser and M. Rothstein, SAC-1 solution of problem No. 7, SIGSAM Bull. 8 (2) (1974) 17--19.
R. Cuculière, An irreducible polynomial, Amer. Math. Monthly 96 (1989) 155--156.
K. Dörge, Die Seltenheit der reduziblen Polynome und der Normalgleichungen, Math. Ann. 95 (1925) 247--256.
J.H. Davenport, Y. Siret and E. Tournier, Computer Algebra (Academic Press, London, 1988).
J.H. Davenport and B.M. Trager, Factorization over finitely generated fields, in: P.S. Wang, Ed., Proc. 1981 Symp. on Symbolic and Algebraic Computing (Assoc. Computing Machinery, New York, 1981) 200--205.
D.E. Daykin, Generation of irreducible polynomials over a finite field, Amer. Math. Monthly 72 (1960) 646--648.
R.A. Dean, Elements of Abstract Algebra (Wiley, New York, 1966).
E. Dehn, Algebraic Equations, An Introduction to the Theories of Lagrange and Galois (Columbia Univ. Press, New York, 1930).
L.E. Dickson, New First Course in the Theory of Equations (Wiley, New York, 1952).
L.E. Dickson, Introduction to the Theory of Algebraic Equations (Wiley, New York, 1903).
L.E. Dickson, Criteria for the irreducibility of functions in a finite field, Bull. Amer. Math. Soc. 13 (1906) 1--8.
L.E. Dickson, Algebra and their Arithmetics, University of Chicago (1923).
L.E. Dickson, Higher irreducible congruences, Bull. Amer. Math. Soc. 3 (1897) 381--389.
D. Dobbs and R. Hanks, A modern course on the theory of equations (Polygonal Publishers., 2nd ed., 1992).
D.E. Dobbs and R. Hanks, A Modern Course on the Theory of Equations (Polygonal Publ. House, Passic, NJ, 1980).
E. Dobrowolski, On a question of Lehmer and the number of irreducible factors of a polynomial, Acta Arith. 34 (1979) 391--401.
H.L. Dorwart and O. Ore, Criteria for the irreducibility of polynomials, Ann. of Math. (2) 34 (1933) 81--94; ibid. 35 (1934) 195.
H.L. Dorwart, Concerning certain reducible polynomials, Duke Math. J. 1 (1935) 70--73.
H.L. Dorwart, Irreducibility of polynomials, Amer. Math. Monthly 42 (1935) 369--381.
G. Dumas, Sur quelques cas d'irréductibilité des polynômes à coefficients rationnels, J. Math. Pures Appl. (6) 2 (1906) 191--258.
D.S. Dummit, Solving solvable quintics, Math. Comp. 57 (1991) 387--401; 59 (1992) 309.
R Dussaud, Sur l'affect des équations numérique et les sous-groupes du groupe symétrique, C.R. Acad. Sci. Paris 266A (1968) 757--759.
H.M. Edwards, Galois Theory, Graduate Texts in Math. 101 (Springer, New York, (1984).
S. Eilenberg and I.M. Niven, The "fundamental theorem of algebra" for quaternions, Bull. Amer. Math. Soc. 50 (1940) 246--248.
G. Eisenstein, Über irreduzible Kongruenzen, J. Reine Angew. Math. 39 (1850) 182.
G. Eisenstein, Über die Irreducibilität und andere Eigenschaften der Gleichung, J. Reine. Angew. Math. 39 (1850) 166--179.
E.B. Elliott, On the existence of a root of a rational integral equation, Proc. Lond. Math. Soc. 25 (1894) 173--184.
D.W. Erbach, J. Fischer and J. Mackay, Polynomials with PSL(2,7) as Galois group, J. Number Theory 11 (1979) 69--75.
S.A. Evdokimov, Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis, J. Soviet Math. 59 (1992) 842--849.
R. Fateman, J. Moses and P. Wang, Solution to problem No. 7 using MACSYMA, SIGSAM Bull. 8 (2) (1974) 14--16.
R.J. Fateman, An improved algorithm for the isolation of polynomial real zeros, in: Proc. 1977 MACSYMA Users' Conf., Berkeley, CA (1977) 43--54.
R.J. Fateman, An improved algorithm for the isolation of polynomial real zeros, in: Proc. of the 1977 MACSYMA Users' Conference, U.S. Govt. Printing Office (1978) 47--51.
W. Feit and E. Rees, A criterion for a polynomial to factor completely over the integers, Bull. London Math. Soc. 10 (1978) 191--192.
M. Fekete and G. Szegö, On algebraic equations with integer coeficients whose roots belong to a given point set, Math. Z. 63 (1955) 158--172.
M. Fekete, Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten, Math. Z. 17 (1923) 228--249.
M. Filaseta, Rouchés theorem for polynomials, Amer. Math. Monthly 97 (1990) 834--835.
H.B. Fine, An unpublished theorem of Kronecker respecting numerical equations, Bull. Amer. Math. Soc. 20 (1914) 339--358.
W. Flügel, Solution to problem 226, Arch. Math. Phys. Ser. 3 15 (1909) 271.
P. Fleischmann, Connections between the algorithms of Berlekamp and Niedereitter for factoring polynomials over Fq, Lin. Algebra Appl. 192 (1993) 101--108.
A. Fröhlich and J.C. Sheperdson, On the factorization of polynomials in a finite number of steps, Math. Z. 62 (1955) 331--334.
K. Friedl and L. Rónyai, Polynomial time solutions to some problems in computational algebra, in: Proc. 17th Annual ACM Symp. Theory of Comput., Providence (1985) 153--162.
A.F. Frumveller, Quadratic factors of polynomials, Amer. Math. Monthly 24 (1917) 208--212.
P. Furtwängler, Über Kriterien für irreduzible und für primitive Gleichungen, Math. Ann. 85 (1922) 34--40.
R. Göttfert, An acceleration of the Neiderreiter factorization algorithm in characteristic 2, Math. Comp. 62 (1994) 831--839.
R. Güting, Approximation of algebraic numbers by algebraic numbers, Michigan Math. J. 8 (1961) 149--159.
V.I. Galiev, A.F. Polupanov and I.E. Sparlinski, Distances from differences of roots of polynomials to the nearest integer, Inform. Process. Lett. 43 (1992) 143--146.
J.A. Gallian and D.J. Rusin, Cyclotomic polynomials and nonstandard dice, Discrete Math. 27 (1979) 245--259.
J.A. Gallian, Contemporary Abstract Algebra (Heath, Lexington, MA, 1986).
F. Gallisot and P. Dussaud, Sur les polynômes f(x) definissant la même extension algébrique d'un corps K, C.R. Acad. Sci. Paris 266A (1968) 904--906.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979) 250--251.
G. Gati, The complexity of solving polynomial equations by prime root extraction, SIAM J. Algebraic Discrete Methods 4 (1983) 70--71.
C.F. Gauss, Disquisitiones Arithmeticae (Leipzig, 1801); English translation: A.A. Clarke (Yale Univ. Press, 1966); also: in: Werke 1, 34.
A.O. Gelfond, Transcendental and Algebraic Numbers (Dover, New York, 1950).
J. Gerst and J. Brillhart, On the prime divisors of polynomials, Amer. Math. Monthly 78 (1971) 250--265.
K. Girstmair, Linear dependence of zeros of polynomials and construction of primitive elements, Manuscripta Math. 39 (1982) 81--97.
O.E. Glenn, Relating to the quadratic factors of a polynomial, Amer. Math. Monthly 23 (1916) 313--315.
S.W. Golomb, Cyclotomic polynomials and factorization theorems, Amer. Math. Monthly 85 (1978) 734--737.
S.W. Golomb, Obtaining specified irreducible polynomials over finite fields, SIAM J. Algebraic Discrete Methods 1 (1980) 411--418.
S.W. Golomb, Theory of transformation groups of polynomials over GF(2), with applications to linear shift register sequences, Information Sciences 1 (1968) 87--109.
J. Griesmer, R.D. Jenks and D.Y.Y. Yun, A SCRATCHPAD solution to problem No. 7, SIGSAM Bull. 9 (3) (1975) 13--17.
W.J. Guerrier, The factorization of the cyclotomic polynomials mod p, Amer. Math. Monthly 75 (1968) 46.
R.E. Guidici and C. Margaglio, Sobre factorizacion de polinomios de cuarto grado, Scientia (Valparaiso) 147 (1976) 70--76.
H. Gunji and D. Arnon, On polynomial factorization over finite fields, Math. Comp. 36 (1981) 281--287.
R.N. Gupta, Other two roots of a normal cubic, Math. Student 45 (3) (1977) 68--72.
H. Hancock, Foundations of the Theory of Algebraic Numbers, Vol. 1 (New York, 1931).
B.A. Hausmann, A new simplification of Kronecker's method of factorization of polynomials, Amer. Math. Monthly 44 (1937) 574--576.
L.E. Heindel, Integer arithmetic algorithms for polynomial real zero determination, in: Proc. Second Symposium on Symbolic and Algebraic Computation (1971) 415--426.
L.E. Heindel, Integer arithmetic algorithms for polynomial real zero determination, J. Assoc. Comput. Mach. 18 (1971) 533--548.
J. Heintz, On polynomials with symmetric Galois group which are easy to compute, Theoret. Comput. Sci. 47 (1986) 99--105.
K. Hensel, Über ein neue Begründung der Theorie der algebraischen Zahlen, J. Reine Angew. Math. 128 (1905) 1--32.
K. Hensel, Über die zu einem algebraischen Körper gehörigen Invarianten, J. Reine Angew. Math. 129 (1905) 68--85.
K. Hensel, Neue Grundlagen der Arithmetic, J. Reine Angew. Math. 127 (1904) 51--84.
K. Hensel, Eine neue Theorie der algebraischen Zahlen, Math. Z. 2 (1918) 433--452.
I.N. Herstein, Topics in Algebra (Xerox College, Lexington, MA, 2nd ed., 1975).
D. Hilbert, Über die Irreducibilität ganzer rationaler Funktionen mit ganzzahligen Coefficienten, J. Reine Angew. Math. 110 (1892) 104--129.
J.B. Holt, The irreducibility of Legendre polynomials, I, Proc. London Math. Soc. (2) 11 (1913) 351--356; II, ibid. 12 (1913) 126--132.
G.M. Hopper and O. Ore, New types of irreducibility criteria, Bull. Amer. Math. Soc. 40 (1934) 216.
A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation (McGraw-Hill, New York, 1970).
M. Huang, Riemann hypothesis and finding roots over finite fields, Proc. 17th Annual ACM Symp. on Theory of Computing (1985) 121--130.
M.A. Huang, Factorization of polynomials over finite fields..., in: Proc. 16th ACM Symp. on Theory of Computing (1984) 175--182.
M.D.A. Huang, Factoring polynomials over finite fields and decomposition of primes in algebraic number fields, J. Algorithms 12 (1991) 482--489.
M.D.A. Huang, Generalized Riemann hypothesis and factoring polynomials over finite fields, J. Algorithms 12 (1991) 464--481.
M.W. Hutchinson, Using synthetic division by quadratics to find rational roots, Math. Teacher 64 (1971) 349--352.
H. Ille, Einige Bemerkungen zu einem von G. Polya Irreduzibilitätskriterium, Jahresber. Deutsch. Math.-Verein. 35 (1926) 204--208.
T. Itoh, Efficient algorithm for solving quadratic equations over finite fields, Electronics Lett. 23 (17) (1987) 869--870.
T. Itoh and S. Tsuji, An efficient algorithm for deciding quadratic residuosity in finite fields GF(pm), Inform. Process. Lett. 30 (1989) 111--114.
N. Jacobson, Basic Algebra I (Freeman, New York, 2nd ed., 1985) 204--325.
C.U. Jensen and N. Yui, Polynomials with Dp as Galois group, J. Number Theory 15 (1982) 347--375.
S.C. Johnson and R.L. Graham, Problem No. 7, SIGSAM Bull. 8 (1) (1974) 4.
L. Königsberger, Über den Eisensteinschen Satz der Irreducibilität algebraischer Gleichungen, J. Reine Angew. Math. 115 (1895) 53--78.
L. Königsberger, Über die Entwicklungsform algebraischer Functionen und die Irreduzibilität algebraischer Gleichungen, J. Reine Angew. Math. 121 (1900) 320--359.
E. Kaltofen, Computer algebra algorithms, in Annual Review of Computer Science 2 (1987) 91--118.
E. Kaltofen, D.R. Musser and B.D. Saunders, A generalized class of polynomials that are hard to factor, SIAM J. Comput. 12 (3) (1983) 473--483.
E. Kaltofen, Effective Hilbert irreducibility, in: J. Fitch, Ed., EUROSAM 84, Lecture Notes in Comput. Sci. 174 (Springer, New York, 1984) 277--284; also: Inform. and Control 66 (1985) 123--137.
E. Kaltofen, Factorization of polynomials, in: B. Buchberger et al., Eds., Computing Supplement 4: Computer Algebra (Springer, New York, 1982) 95--113.
E. Kaltofen, Polynomial factorization 1982--1986, in: D.V. Chudnovsky and R.D. Jenks, Eds., Computers in Mathematics (Marcel Dekker, New York, 1990) 285--309.
E. Kaltofen, D.R. Musser and B.D. Saunders, A generalized class of polynomials which are hard to factor, in: P.S. Wang, Ed., Proc. 1981 Symp. on Symbolic and Algebraic Computing (Assoc. Computing Machinery, New York, 1981) 188--194.
R. Kannan, A.K. Lenstra and L. Lovasz, Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers, Math. Comp. 50 (1988) 235--250.
R. Kannan, A.K. Lenstra and L. Lovász, Polynomial factorization and non-randomness of bits of algebraic and some transcendental numbers, in: Proc. 16th Annual ACM Symp. on Theory of Computing (1984) 191--200; also: Math. Comp. 50 (1988) 235--250.
R. Kannan, Algorithmic geometry of numbers, in Annual Review of Computer Science 2 (1987) 231--267.
N.D. Kazarinoff, Ruler and the Round, Complementary Ser. Math. 15 (Prindle, Weber and Schmidt, Boston, MA, 1970).
H. Kempfert, On the factorization of polynomials, J. Number Theory 1 (1969) 116--120.
A.J. Kempner, On irreducible equations admitting roots of the form α+ρei θ, Tôhoku Math. J. 13 (1918) 253--265.
A.J. Kempner, On the complex roots of algebraic equations, Bull. Amer. Math. Soc. 41 (1935) 809--843.
A.J. Kempner, Über irreduzible Gleichungen die unter ihren Wurzeln auch solcher mit rationalen reellen Teil oder mit rationalem absolutem Betrag zulassen, Arch. Math. Phys. Ser. 3 25 (1916) 236--242.
D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, Vol. II (Addison-Wesley, Reading, MA, 1969) 363--443; (2nd ed., 1981) 399--505.
J. Kovacic, An Eisenstein criterion for noncommutative polynomials, Proc. Amer. Math. Soc. 34 (1972) 25--29.
L. Kronecker, Grundzüge einer arithmetischen Theorie der algebraischen Grössen, J. Reine Angew. Math. 92 (1882) 1--121.
L. Kronecker, Vorlesungen Über die Zahlentheorie (Leipzig, 1901).
L. Kronecker, Über die Irreducibilität von Gleichungen, Mon. Deutsche Akad. Wiss. Berlin (1880) 155--163.
L. Kronecker, Mémoire sur les facteurs irreductibles de l'expression xn-1, J. Math. Pures Appl. (1) 19 (1854) 177--192.
E.E. Kummer, Über die Zerlegung der aus Wurzeln der Einheit gebildeten complexen Zahlen in ihre Primfaktoren, J. Reine Angew. Math. 35 (1847) 327--367.
E.E. Kummer, Über die Divisoren gewisser Formen der Zahlen, welche aus der Theorei der Kreistheilung entstehen, J. Reine Angew. Math. 30 (1846) 107--116.
V.A. Kurvatov, Galois extensions of prime degree and their primitive elements, Soviet Math. (Iz. VUZ) 21 (1977) 45--53.
J.C. Lagarias and A.M. Odlyzko, Effective versions of the Chebotarev density theorem, in: A. Frohlich, Ed., Algebraic Number Fields, L-functions, and Galois Properties (Academic Press, New York, 1977) 409--464.
M.E. LaMacchia, Polynomials with Galois group PSL(2,7), Comm. Algebra 8 (1980) 983--992.
S. Landau and G. Miller, Solvability by radicals is in polynomial time, in: Proc. 15th Annual Symp. on the Theory of Computing (1983) 140--151.
S. Landau, Factoring polynomials quickly, Notices Amer. Math. Soc. 34 (1987) 3--8.
S. Landau, Factoring polynomials over algebraic number fields, SIAM J. Comput. 14 (1985) 184--195.
S. Lang, Algebra (Addison-Wesley, Reading, MA, 1965) 128--130.
S. Lang, Algebraic Number Theory (Addison-Wesley, Reading, MA, 1970).
S. Lang, Undergraduate Algebra (Springer, New York, 1987).
L. Langemyr and S. McCallum, The computation of polynomial greatest common divisors over an algebraic number field, J. Symb. Comput. 8 (1989) 429--448.
L. Langemyr, Circuits for computing the GCD of two polynomials over an algebraic number field, Inform. Process. Lett. 38 (1991) 129--134.
M. Langevin, Fifty Years of Polynomials. Proceedings Paris 1988, Lecture Notes in Math. 1415 (Springer, New York, 1990).
M. Lauer, Generalized p-adic constructions, SIAM J. Comput. 12 (1983) 395--410.
M. Lauer, Computing in homomorphic images, in: G.E. Collins and R. Loos, Eds., Computer Algebra: Symbolic and Algebraic Computation (Springer, Berlin, 2nd ed., 1983) 139--168.
W. Lawton, Heights of algebraic numbers and Szegö's theorem, Proc. Amer. Math. Soc. 49 (1975) 47--50.
D. Lazard, On polynomial factorization, in: J. Calmet, Ed., Computer Algebra (EUROCAM 82) (Springer, Berlin, 1982) 126--134.
M.A. Lee, Some irreducible polynomials which are reducible mod p for all p, Amer. Math. Monthly 76 (1969) 1125.
D.H. Lehmer, Factorization of certain cyclotomic functions, Ann. of Math. 34 (1933) 461--479.
A.K. Lenstra, Factorisatie van polynomen, Studieweek Getaltheorie en Computers, Mathematisch Centrum, Amsterdam (1980) 95--134.
A.K. Lenstra, H.W. Lenstra and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982) 515--534.
A.K. Lenstra, Lattices and factorizations of polynomials, SIGSAM Bull. 15 (3) (1981) 15--16.
A.K. Lenstra, Polynomial factorization by root approximation, EUROSAM 84, Lecture Notes in Comput. Sci. 174 (Springer, New York, 1984) 272--276.
A.K. Lenstra, Factoring polynomials over algebraic number fields, J.A. Van Hulzen, Ed., Computer Algebra: Proc. EUROCAL 1983 (Springer, Berlin, 1983) 245--254.
A.K. Lenstra, Lattices and factorizations of polynomials over algebraic number fields, in: J. Calmet, Ed., Computer Algebra (EUROCAM 82) (Springer, New York, 1982) 32--39.
P.A. Leonard, On factoring quartics (mod p), J. Number Theory 1 (1969) 113--115.
P.A. Leonard, On constructing quartic extensions of GF(p), Norske Vid. Selsk. Forh. (Trondheim) 40 (1967) 96--97.
P.A. Leonard, Factorization of general polynomials, J. Number Theory 6 (1974) 335--338.
R. Lidl and H. Niederreiter, Finite Fields (Addison-Wesley, 1983).
R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications (Cambridge University Press, Cambridge, 1986).
S. Lipka, Über die Irreduzibilität von Polynomen, Math. Ann. 118 (1941--1943) 235--245.
J. Lipson, Chinese remainder and interpolation algorithms, in: Proc. 2nd Symp. on Symbolic and Algebraic Computation (1971) 372--391.
R.J. Lipton and L.J. Stockmeyer, Evaluation of polynomials with super-preconditioning, Proc. 8th Ann. ACM Symp. on Theory of Computing (1976) 174--180; also: J. Comput. System Sci. 16 (1978) 124--139.
D.B. Lloyd, The use of finite polynomial rings in the factorization of the general polynomial, J. Res. Nat. Bur. Standards Sect. B 69 (1965) 189--212.
D.B. Lloyd, Factorization of the general polynomial by means of its homomorphic congruential functions, Amer. Math. Monthly 71 (1964) 863--870.
D.B. Lloyd and H. Remmers, Polynomial factor tables over finite fields, Math. Algorithms 2 (1967) 85--99.
A.F. Long Jr, Factorization of irreducible polynomials over a finite field with the substitution Xpr --> X for X, Duke Math. J. 40 (1973) 63--76.
A.F. Long, Classification of irreducible factorable polynomials over a finite field, Acta Arith. 12 (1967) 301--313.
R. Loos, Computing in algebraic extensions, in: B. Buchberger, G.E. Collins and R. Loos, Eds., Computer Algebra: Symbolic and Algebraic Computation (Springer, New York, 1982) 173--188.
R. Loos, Computing rational zeros of integer polynomials by p-adic expansions, SIAM J. Comput. 12 (1983) 286--293.
O.P. Lossers, Integer roots of cubics, Amer. Math. Monthly 96 (1989) 841--842.
R. Louboutin, Sur la mésure de Mahler des nombres algébrique, C.R. Acad. Sci. Paris 296 (1983) 707--708.
W.V. Lovitt, Elementary Theory of Equations (Prentice-Hall, New York, 1939).
E. Lucas, Sur les formules de Cauchy et de Lejeune-Dirichlet, Ass. Francaise pour l'avancement des Sciences. Comptes Rendue 7 (1878) 64--173.
F. Lucas, Theorie des fonctions numeriques simplement periodique, Amer. J. Math. 1 (1878) 184--240; 289--321.
M. Lucks, A fast implementation of polynomial factorization, Proc. 1986 ACM Symp. Symbolic Algebraic Computation (1986) 228--232.
H. Lugowski and H.J. Weinert, Grundzüge der Algebra, Teil 3 (Leipzig, 1967) Chapter IX.
K. Ma and J. von zur Gathen, Analysis of Euclidean algorithms for polynomials over finite fields, J. Symb. Comput. 9 (1990) 429--455.
C.C. MacDuffee, Theory of Equations (Wiley, New York, 1954) Chapter 7.
R.J. MacEleice, Factorization of polynomials over finite fields, Math. Comp. 23 (1969) 861--868.
K. Mahler, On a theorem by E. Bombieri, Indag. Math. 22 (1960) 245--253.
E. Maillet, Sur la détermination du groupe des équations numériques, J. Math. Pures Appl. (5) 5 (1899) 205--216.
K. Manders and L. Adleman, NP-complete decision problems for quadratic polynomials, in: Proc. 8th Annual ACM Symp. on Theory of Computing (1976) 23--29.
H.B. Mann, The solution of equations by radicals, J. Algebra 29 (1974) 551--554.
R.W. Marsh, Tables of Irreducible Polynomials over GF(2) through Degree 19 (NSA, Washington, 1957).
J.E. Maxfield and M.W. Maxfield, Abstract Algebra and Solution by Radicals (Dover, New York, 1992).
K. McCann and K.S. Williams, On the residues of a cubic polynomial, Canad. Math. Bull. 10 (1967) 29--38.
K. McCann and K.S. Williams, The distribution of the residues of a quartic polynomial, Glasgow Math. J. 8 (1967) 67--88.
R.J. McEliece, Factorization of polynomials over finite fields, Math. Comp. 23 (1969) 861--867.
K.E. McLain and H.M. Edgar, A note on Golomb's "Cyclotomic polynomials and factorization theorems", Amer. Math. Monthly 88 (1981) 753.
K. Meer, Computations over Z and R: a comparison, J. Complexity 6 (1990) 256--263.
A.J. Menezes, P.C. van Oorschott and S.A. Vanstone, Some computational aspects of root finding in GF(qm), in Symbolic and Algebraic Computation, Lecture Notes in Comput. Sci. 358 (Springer, New York, 1989) 259--270.
A.J. Menezes, P.C. Van Oorschott and S.A. Vanstone, Subgroup refinement algorithms for root finding in GF(q), SIAM J. Comput. 21 (1992) 228--239.
G. Mignosi, Risoluzione apiristica della equazione generale cubica in un corpo numerico finito, Rend. Circ. Mat. Palermo 53 (1929) 411--427.
M. Mignotte, Some problems about polynomials, in: R.D Jenks, Ed., Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation (1976) 227-- 228.
M. Mignotte, Mathematics for Computer Algebra (Springer, New York, 1992).
M. Mignotte and M. Payafar, Distance entre les racines d'un polynôme, RAIRO Anal. Numér. 13 (1979) 181--192.
M. Mignotte, Some inequalities about univariate polynomials, in: Proc. 1981 Symp. on Symbolic and Algebraic Computation (Assoc. Computing Machinery, New York, 1981) 195--199.
M. Mignotte, Inequalities about factors of integer polynomials, SIGSAM Bull. 21 (4) (1987) 24.
M. Mignotte, An inequality about factors of polynomials, Math. Comp. 28 (128) (1974) 1153--1157.
M. Mignotte, An inequality about irreducible factors of integer polynomials, J. Number Theory 30 (2) (1988) 156--166.
M. Mignotte, Algorithmes relatifs à la décomposition des polynômes, Theoret. Comput. Sci. 1 (1976) 227--235.
M. Mignotte, Factorisation des polynômes sur un corps fini, Asterisque 38--39 (1976) 149--157.
M. Mignotte and C. Schnorr, Calcul déterministique des racines d'un polynôme dans un corps fini, C.R. Acad. Sci. Paris 306 (1988) 467--472.
M. Mignotte, Calcul des racines d-iemes dans un corps fini, C.R. Acad. Sci. Paris Ser. 1 290 (1980) 205--206.
A. Miola and D.Y.Y. Yun, The computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms, ACM SIGSAM Bull. 31 (1974) 46--54.
A.P. Mishina and I.V. Proskuryakov, Higher Algebra: Linear Algebra, Polynomials and General Algebra (Pergamon, Oxford, 1965).
D.A. Mitkin, Stepanov method of the estimation of the number of roots of some equations, Math. Notes 51 (1992) 565--570.
R.T. Moenck, On the efficiency of algorithms for polynomial factoring, Math. Comp. 31 (1977) 235--250.
J. Molk, Sur une notion qui comprend celle de la divisibilité et sur la théorie générale de l'élimination, Acta Math. 6 (1885) 1--166.
P.M.A. Moore and A.C. Norman, Implementing a polynomial factorization problem, in: P.S. Wang, Ed., Proc. Symp. on Symbolic and Algebraic Computation (Assoc. Computing Machinery, New York, 1981) 109--116.
L.J. Mordell, On the least residue and non-residue of a polynomial, J. London Math. Soc. 38 (1963) 451--453.
O. Moreno, Discriminants and the irreducibility of a class of polynomials in a finite field of arbitrary characteristic, J. Number Theory 28 (1988) 62--65.
O. Moreno, Discriminants and the irreducibility of a class of polynomials, Lecture Notes in Comput. Sci. 228 (1988) 178--181.
J. Moses and D.Y.Y. Yun, The EZ GCD algorithm, in: Proc. ACM Annual Conf. (1973) 159--166.
D.R. Musser, Multivariate polynomial factorization, J. Assoc. Comput. Mach. 22 (1975) 291--308.
D.R. Musser, On the efficiency of a polynomial irreducibility test, J. Assoc. Comput. Mach. 25 (1978) 271--282.
T. Nagell, Sur les diviseurs premiers des polynômes, Acta Arith. 15 (1969) 235--244.
T. Nagell, Über einige Irreduzibilitätskriterien, Norske Vid. Selsk. Forh. (Trondheim) 5 (1931) 121--125.
E. Netto, Vorlesungen über Algebra (Teubner, Leipzig, 1896).
E. Netto, Über die Irreductibilität ganzzahliger ganzer Functionen, Math. Ann. 48 (1897) 82--88.
I. Newton, Lecture Notes (1683); How are equations to be resolved, in: Mathematical Papers of Isaac Newton, 5 (Cambridge Univ. Press, London, 1973) 337--423.
H. Niederreiter, Factorization of polynomials and some linear algebra problems over finite fields, Lin. Algebra Appl. 192 (1993) 301--328.
H. Niederreiter, A new efficient factorization algorithm for polynomials over small finite fields, Applicable Algebra in Engrg. Comm. Comp. 4 (1993) 81--87.
H. Niederreiter, Factoring polynomials over finite fields using differential equations and normal bases, Math. Comp. 62 (1994) 819--830.
E. Noether, Ein algebraisches Kriterium für absolute Irreduzibilität, Math. Ann. 85 (1922) 26--33.
M. Noether, Gleichungen mit vorgeschriebener Gruppe, Math. Ann. 78 (1918) 221--229.
A.C. Norman, Towards a REDUCE solution to SIGSAM problem 7, SIGSAM Bull. 12 (4) (1978) 14.
A.C. Norman and P.W. Wang, A comparison of the vaxima and reduce factorization packages, SIGSAM Bull. 17 (1) (1983) 28--30.
O. Ore and H.L. Dorwart, Criteria for the irreducibility of polynomials, Ann. of Math. (2) 34 (1933) 81--94.
O. Ore, Zur Theorie der Eisensteinschen Gleichungen, Math. Z. 20 (1924) 267--279.
O. Ore, Weitere Untersuchungen zur Theorie der algebraischen Körper, Acta Math. 45 (1925) 145--160.
O. Ore, Zur Theorie der algebraischen Körper, Acta Math. 44 (1923) 219--314.
O. Ore, Irreduzibilität in algebraischen Körpern, Norsk Matematisk Forenings skrifter 1 (9) (1922).
O. Ore, Über Gleichungen mit primitiven Gruppen, Math. Z. 19 (1924) 276--283.
O. Ore, Zur Theorie der Irreduzibilitätskriterien, Math. Z. 18 (1923) 278--288.
O. Ore, Einige Bemerkungen über Irreduzibilität, Jahresber. Deutsch. Math.-Verein. 44 (1934) 147--151.
O. Ore, Contributions to the theory of finite fields, Trans. Amer. Math. Soc. 36 (1934) 243--274.
O. Ore, On a special class of polynomials, Trans. Amer. Math. Soc. 35 (1933) 559--584; 36 (1934) 275(E)).
J.-P. Dedieu and M.-F. Roy, Equimodular factorization of real polynomials and computer algebra, C.R. Acad. Sci. Paris 309 (1989) 519--522.
M.-P. van der Hulst and A.K. Lenstra, Polynomial factorization by transcendental evaluation, in: Proc. EUROCAL 85 (1985) 138--145.
M. Pathiaux, Determination effective des polynômes de A. Connes relativement à un nombre de Pisot, Séminaire Delange-Pisot-Poitou, 13e année (1971/72) No. G5 1--3.
R. Peralta, A simple and fast probabilistic algorithm for computing square roots modulo a prime number, IEEE Trans. Inform. Theory 32 (1986) 846--847.
R.A. Perez, Solving a polynomial equation of degree greater than two, Math. Teacher 80 (1987) 207--208.
O. Perron, Neue Kriterien für Irreduzibilität algebraischer Gleichungen, J. Reine Angew. Math. 132 (1907) 288--307.
O. Perron, Über eine Anwendung der Idealtheorie auf die Frage nach der Irreduzibilität algebraischer Gleichungen, Math. Ann. 60 (1905) 448--458.
B.R. Peskin and D.R. Richman, A method to compute minimum polynomials, SIAM J. Algebraic Discrete Methods 6 (1985) 292--299.
W.W. Peterson, Error Correcting Codes (MIT, Cambridge, MA, 1961) 87--106; 251--270.
K. Petr, Über die Reduzibilität eines Polynoms mit ganzzahligen Koeffizienten nach einem Primzahlmodul, Casopis Pest. Mat. Fys. 66 (1937) 85--94.
E.L. Petterson, Einige aus den Grössenbeziehungen der Wurzeln abgeleitete Irreduzibilitätskriterien, Math. Ann. 114 (1937) 79--83.
E.L. Petterson, Ein Irreduzibilitätskriterium, Ark. Mat. Astr. Phys. B 26 (3) (1937) 1--3.
T.A. Pierce, The numerical factors of the arithmetic forms &Prod;i=1n(1 ± αim), Ann. of Math. (2) 18 (1916--1917) 53--64.
J.R. Pinkert, An exact method of finding the roots of a complex polynomial, ACM Trans. Math. Software 2 (1967) 351--363.
D.A. Plaisted, Some polynomial and integer divisibility problems are NP-hard, SIAM J. Comput. 7 (1978) 458--464.
D.A. Plaisted, New NP-hard and NP-complete polynomial and integer divisibility problems, in: Proc. 18th IEEE Symp. on Foundations of Computer Science (1977) 241--253.
D.A. Plaisted, New NP-hard and NP-complete polynomial and integer divisibility problems, Theoret. Comp. Sci. 31 (1984) 125--138.
D.A. Plaisted, Sparse complex polynomials and polynomial reducibility, J. Comput. System Sci. 14 (1977) 210--221.
A. Poli and M.C. Gennero, FAST16: a software program for factoring polynomials over large GF(p), Lecture Notes in Comput. Sci. 307 (1988) 139--156.
H. Pollard, The Theory of Algebraic Numbers, Carus Math. Monographs 9 (Wiley, New York, 1950).
G. Polya, Verschiedene Bemurkungen zur Zahlentheorie, Jahresber. Deutsch. Math.-Verein. 28 (1919) 31--40.
L. Rédei, Lückenhafte Polynome über Endlichen Körpern (Birkháuser, Basel, 1970) 1--100.
L. Rédei, Bemerkung zu meiner Arbeit "Über die Gleichungen dritten und vierten Grades in endlichen Körpern", Acta Sci. Math. (Szeged) 11 (1947) 184--190.
L. Rédei, Über die Gleichungen dritten und vierten Grades in endlichen Körpern, Acta Sci. Math. (Szeged) 11 (1948) 95--105.
L. Rédei and P. Turan, Zur Theorie der algebraischen Gleichungen über endlichen Körpern, Acta Arith. 5 (1959) 223--225.
L. Rónyai, Factoring polynomials over finite fields, Proc. 28th IEEE Symp. on Foundations of Computer Science (1987), 132--137; also: J. Algorithms 9 (1988) 391--400.
L. Rónyai, Galois groups and factoring polynomials over finite fields, in: 30th Annual Symp. on Foundations of Computer Science (IEEE Computer Science Press, Los Alamitos, CA, 1989) 99--104.
L. Rónyai, Factoring polynomials modulo special primes, Combinatorica 9 (2) (1989) 199--206.
M.O. Rabin, Probabilistic algorithms in finite fields, SIAM J. Comput. 9 (1980) 273--280.
G. Rados, Zur Theorie der Kongruenzen höheren Grades, J. Reine Angew. Math. 99 (1886) 258--260.
R. Ree, Proof of a conjecture of S. Chowla, J. Number Theory 3 (1971) 210--212.
G.W. Reitwiesner, Integer arithmetic determination of polynomial real roots, J. Res. Nat. Bur. Standards Sect. B 78 (1974) 39--43.
R.M. Robinson, Intervals containing infinitely many sets of conjugate algebraic integers, in: Studies in Mathematical Analysis and Related Topics: Essays in Honour of George Polya (Stanford Univ. Press, Stanford, CA, 1962) 305--315.
R.M. Robinson, Three old problems about polynomials with real roots, Amer. Math. Monthly 95 (1988) 329--330.
R.M. Robinson, Algebraic equations with spans less than 4, Math. Comp. 18 (1964) 547--559.
M. Rothstein, On pseudo-resultants, in: J. Fitch, Ed., EUROSAM 84, Lecture Notes in Comput. Sci. 174 (Springer, New York, 1984) 387--396.
P. Samuel, Théorie des Nombres Algébriques (Hermann, Paris, 1968) Appendix, Chapter 2.
A. Schönhage, Quasi-gcd computations, J. Complexity 1 (1985) 118--137.
A. Schönhage, Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm, in: Proc. 11th Internat. Colloq. on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 172 (Springer, New York, 1984) 436--447.
A. Schinzel and H. Zassenhaus, A refinement of two theorems of Kronecker, Michigan Math. J. 12 (1965) 81--84.
A. Schinzel, On a theorem of Bauer and some of its applications, Acta Arith. 11 (1966) 333--344.
F. Schmidt, Integer roots (Problem 87-9), Math. Intelligencer 9 (1987) 40.
C.P. Schnorr and J.P. van der Wiele, On the additive complexity of polynomials, Theoret. Comput. Sci. 10 (1980) 1--18.
R.J. Schoof, Quintic polynomials and real cyclotomic fields with large class numbers, Math. Comp. 50 (1988) 543--556.
R.J. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp. 44 (1985) 483--494.
I. Schur, Beispiele für Gleichungen ohne Affekt, Jahresber. Deutsch. Math.-Verein. 29 (1920) 145--150.
I. Schur, Zur Irreduzibilitát der Kreisteilungsgleichung, Math. Z. 29 (1928) 463.
I. Schur, Aufgabe 275, Arch. Math. Phys. Ser. 3 15 (1909) 259.
I. Schur, Affektlose Gleichungen in der Theorie der Laguerreschen und Hermiteschen Polynome, J. Reine. Ang. Math. 165 (1931) 52--58.
J.T. Schwartz, Probabilistic algorithms for the verification of polynomial identities, in: E.W. Ng, Ed., Symbolic and Algebraic Computation: Proc. Eurosam Symp., Marseille, 1979, Lecture Notes in Comput. Sci. 72 (Springer, New York, 1979) 216--226.
S. Schwarz, On the reducibility of polynomials over a finite field, Quart. J. Math. Oxford (2) 7 (1956) 110--124.
J.R. Sendra, Hankel matrices and computer algebra, SIGSAM Bull. 24 (3) (1990) 17--26.
J.A. Serret, Détermination des fonctions entières, suivant un module premier, dans le cas où le degre est égal au module, J. Math. Pures Appl. Ser. 2 18 (1873) 301--304.
V. Shoup, New algorithms for finding irreducible polynomials over finite fields, Math. Comp. 54 (1990) 435--447.
V. Shoup, New algorithms for finding irreducible polynomials over finite fields, 29th Annual Symp. on Foundations of Computer Science (IEEE Computer Science Press, 1988) 283--290.
V. Shoup, On the deterministic complexity of factoring polynomials over finite fields, Inform. Process. Lett. 33 (1990) 261--267.
V. Shoup, Smoothness and factoring polynomials over finite fields, Inform. Process. Lett. 38 (1991) 39--42.
V. Shoup, A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic, Proc. Inter. Symp. on Symbolic and Algebraic Computation (1991) 14--21.
C.L. Siegel, Algebraic integers whose conjugates lie in the unit circle, Duke Math. J. 11 (1944) 597--602.
T. Skolem, Die Anzahl der Wurzeln der Kongruenz x3+ax+b modp für die verschiedenen Paare a,b, Norske Vid. Selsk. Forh. (Trondheim) 14 (1942) 161--164.
T. Skolem, On a certain connection between the discriminant of a polynomial and the number of its irreducible factors modp, Norsk Mat. Tidskr. 34 (1952) 81--85.
C.J. Smyth, On the product of conjugates outside the unit circle of an algebraic integer, Bull. London Math. Soc. 3 (1971) 169--175.
McKay, Some remarks on computing Galois groups, SIAM J. Comput. 8 (1979) 344--347.
R.P. Staduhar, The determination of Galois groups, Math. Comp. 27 (1973) 981--996.
R.P. Stauduhar, The determination of Galois groups, Math. Comp. 27 (1973) 981--996.
E. Steinitz, Algebraischen Theorie der Körper, J. Reine Angew. Math. 137 (1910) 167--309.
R.G. Swan, Factorization of polynomials over a finite field, Pacific J. Math. 12 (1962) 1099--1106.
J.J. Sylvester, On the divisors of cyclotomic functions, Amer. J. Math. 2 (1879) 367--368.
J.M. Thomas, Theory of Equations (McGraw-Hill, New York, 1938).
K. Thull, Approximation by continued fraction of a polynomial real root, in: Proc. EUROSAM 1984, Cambridge, Lecture Notes in Comput. Sci. 174 (1984) 367--377.
B. Trager, Algebraic factoring and rational function integration, in: R.D. Jenks, Ed., Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation (Assoc. Computing Machinery, New York, 1976) 219--226.
B.M. Trager and P.S.-H. Wang, New algorithms for polynomial square-free decomposition over the integers, SIAM J. Comput. 8 (1979) 300--305.
V. Trevisan and P. Wang, Practical factorization of univariate polynomials over finite fields, Proc. Intern. Symp. on Symbolic and Algebraic Computation (1991) 22--31.
N. Tschebotaröw, Grundzüge der Galoischen Theorie (Noordhoff, Groningen, 1950).
S.M. Turner, Square roots mod p, Amer. Math. Monthly 101 (1994) 443--449.
S. Uchiyama, Sur les nombres des valeurs distinctes d'un polynôme a coefficients dans un corps fini, Proc. Japan Acad. 30 (1954) 930--933.
P.C. van Oorschott and S.A. Vanstone, A geometric approach to root finding in GF(qm), IEEE Trans. Inform. Theory 35 (1989) 444--453.
P.C. van Oorschott and S.A. Vanstone, On splitting sets in block designs and finding roots of polynomials, Discrete Math. 84 (1990) 71--85.
B.L. Van der Waerden, Algebra I (Springer, Berlin, 1960); English translation: F. Blum (Ungar, New York, 1953).
B.L. Van der Waerden, Modern Algebra (Ungar, New York, 1943).
B.L. Van der Waerden, Die Seltenheit der Gleichungen mit Affect, Math. Ann. 109 (1934) 13--16.
R. Varshamov, A general method of synthesising irreducible polynomials over Galois fields, Soviet Math. Dokl. 29 (1984) 334--336.
G. Viry, Factorization sur Z[x] des polynomes de degre eleve a l'aide d'un monomorphisme, RAIRO Inform. Theorie Appl. 24 (1990) 387--407.
J. von zur Gathen, Parallel arithmetic computations: a survey, in: J. Gruska et al., Ed., Mathematical Foundations of Computer Science (Springer, New York, 1986) 93--112.
J. von zur Gathen and V. Strassen, Some polynomials that are hard to compute, Theoret. Comput. Sci. 11 (1980) 331--335.
J. von zur Gathen, Computing powers in parallel, SIAM J. Comput. 16 (1987) 930--945.
J. von zur Gathen, Irreducible polynomials over finite fields, in: Proc. 6th Conf. on Foundations of Software Technology and Theoretical Computer Science (Springer, Berlin, 1986) 252--262.
J. von zur Gathen, Algebraic complexity theory, in: J.F. Traub et al., Eds., Annual Reviews of Computer Science 3 (Annual Reviews, Palo Alto, CA, 1988) 317--348.
J. von zur Gathen, Factoring polynomials and primitive elements for special primes, Theoret. Comput. Sci. 52 (1987) 77--89.
J. von zur Gathen, A polynomial factorization challenge, SIGSAM Bull. 26 (2) (1992) 22--24.
J. Von zur Gathen, Hensel and Newton methods in valuation rings, Math. Comp. 42 (1984) 637--661.
J. Von zur Gathen, Parallel algorithms for algebraic problems, in: 15th ACM Symp. on Theory of Computing (1983) 17--23; also: SIAM J. Comput. 13 (1984) 802--824.
J. Von zur Gathen, Factoring polynomials and primitive elements for special primes, Theoret. Comput. Sci. 52 (1987) 77--89.
R.D. Von Sterneck, Über die Anzahl inkongruenter Werte die eine ganze Function dritte Grades annimont, Sitzungsber. Akad. Wiss. Wien. Math. Kl. 116 (1907) 895--904.
Schönemann, Von denjenigen Moduln welche Potenzen von Primzahlen sind, J. Reine Angew. Math. 32 (1846) 93--105.
J.H. Wahab, Irreducibility of polynomials, Amer. Math. Monthly 68 (1961) 366--367.
J.H. Wahab, New cases of irreducibility for Legendre polynomials, Duke Math. J. 19 (1952) 165--176.
P.S. Wang and B.M. Trager, New algorithms for polynomial square-free decomposition over the integers, SIAM J. Comput. 8 (1979) 300--305.
P.S. Wang and L.P. Rothschild, Factoring polynomials over the integers, SIGSAM Bull. 7 (4) (Bulletin No. 28) (1973) 21--29.
P.S. Wang, Parallel p-adic constructions in the univariate polynomial factoring algorithm, in: V.E. Lewis, Ed., Proc. 1979 MACSYMA Users Conference (MIT Press, Cambridge, MA, 1979) 310--318.
P.S. Wang, Early detection of true factors in univariate polynomial factorization, Proc. EUROCAL '83 (Springer, Berlin, 1983) 225--235.
P.S. Wang, Parallel univariate polynomial factorization on shared-memory multiprocessors, in: Proc. Intern. Symp. On Symbolic and Algebraic Comp. (1990) 145--151.
J.J. Wavrik, Computers and the multiplicity of polynomial roots, Amer. Math. Monthly 89 (1982) 34--56.
U. Wegner, Über die Irreduzibilität einer Klasse von ganzen rationalen Funktionen, Jahresber. Deutsch. Math.-Verein. 40 (1930) 239--241.
P.J. Weinberger, Finding the number of factors of a polynomial, J. Algorithms 5 (1984) 180--186.
P.J. Weinberger and L.P. Rothschild, Factoring polynomials over algebraic number fields, ACM Trans. Math. Software 2 (1976) 335--350.
L. Weisner, Irreducibility of polynomials of degree n which assume the same value n times, Bull. Amer. Math. Soc. 41 (1935) 248--252.
L. Weisner, Irreducibility of polynomials of degree n which assume the same value n times, Bull. Amer. Math. Soc. 40 (1934) 662; 41 (1935) 248--252.
L. Weisner, Criteria for the irreducibility of polynomials, Bull. Amer. Math. Soc. 40 (1934) 864--870.
L.O. Weisner, Introduction to the Theory of Equations (Macmillan, New York, 1938).
J. Westlund, On the irreducibility of certain polynomials, Amer. Math. Monthly 16 (1909) 66--67.
H. Weyl, Über die Gleichverteilung von Zahlen modulo Eins, Math. Ann. 77 (1916) 313--352.
H. Whitney, Complex Analytic Varieties (Addison-Wesley, Reading, MA, 1972) 337--347.
M. Willett, Factoring polynomials over a finite field, SIAM J. Appl. Math. 35 (1978) 333--337.
K.S. Williams, Pairs of consecutive residues of polynomials, Canad. J. Math. 19 (1967) 655--666.
K.S. Williams, On the least non-residue of a quartic polynomial, Proc. Cambridge Philos. Soc. 62 (1966) 429--431.
K.S. Williams, On two conjectures of Chowla, Canad. Math. Bull. 12 (1969) 545--565.
K.P. Yiu, On the root computation of polynomials over a finite field using a stored table approach, Proc. IEEE 71 (1983) 538--539.
K. Yokoyama, M. Noro and T. Takeshima, On determining the solvability of polynomials, in: Proc. Intern. Symp. on Symbolic and Algebraic Computation (1990) 127--134.
D.Y.Y. Yun, Algebraic algorithms using p-adic constructions, in: R.D. Jenks, Ed., Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation (1976) 248--259.
D.Y.Y. Yun, On square-free decomposition algorithms, in: R.D. Jenks, Ed., Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation (1976) 26--35.
D.Y.Y. Yun and D.R. Stoutmeyer, Symbolic mathematical computation, in: Encyclopedia of Computer Science and Technology, Vol. 15 (Supp.) 280.
D.Y.Y. Yun, A p-adic division with remainder algorithm, SIGSAM Bull. 8 (4) (Issue No. 32) ( 1974) 27--32.
D.Y.Y. Yun, Hensel meets Newton..algebraic constructions in an analytic setting, in: J.F. Traub, Ed., Analytic Computational Complexity (Academic Press, New York, 1976) 205--215.
H. Zassenhaus, On the fundamental theorem of algebra, Amer. Math. Monthly 74 (1967) 485--497.
H. Zassenhaus, A real root calculus, in: J. Leech, Ed., Computational Problems in Abstract Algebra (Pergamon, Oxford, 1970) 383--392.
H. Zassenhaus, A remark on the Hensel factorization method, Math. Comp. 32 (1978) 287--292.
H. Zassenhaus, On the group of an equation, in: G. Birkhoff and M. Hall, Eds., Computers in Algebra and Number Theory (SIAM/Amer. Math. Soc. Proc., 1971) 69--88.
H. Zassenhaus, The group of an equation, Nachr. Akad. Wiss. Göttingen (1967) 147--166.
H. Zassenhaus, On Hensel factorization I, J. Number Theory 1 (1969) 291--311.
H. Zassenhaus, Polynomial time factoring of integral polynomials, SIGSAM Bull. 15 (2) (1981) 6--7.
H. Zassenhaus, On the Van der Waerden criteria for the group of an equation, in: E.W. Ng, Ed., Symbolic and Algebraic Computation, Lecture Notes in Comput. Sci. 72 (Springer, New York, 1979) 95--107.
H. Zassenhaus, On Hensel factorization II, Symposia Math. 15 (1975) 499--513.
H. Zassenhaus and J. Liang, On a problem of Hasse, Math. Comp. 23 (1969) 515--519.
H.G. Zimmer, Computational problems, methods and results in algebraic number theory, in: Lecture Notes in Math. 262 (Springer, Berlin, 1972).
R. Zippel, Newton's iteration and the sparse Hensel algorithm, in: P.S. Wang, Ed., Proc. 1981 ACM Symp. on Symbolic and Algebraic Computation (Assoc. Computing Machinery, New York, 1981) 68--72.
R.E. Zippel, Probabilistic algorithms for sparse polynomials, in: E.W. Ng, Ed., Symbolic and Algebraic Computation (Springer, Heidelberg, 1979) 216--226.