Publication:4248251
zbMath0927.12004MaRDI QIDQ4248251
Maurice Mignotte, Doru Ştefănescu
Publication date: 7 June 1999
norm; algorithms; upper bounds; height; complex polynomials; factorization of polynomials over finite fields; finite fields; polynomials; Mahler measure; cyclotomic polynomials; length; resultant; algebraic complexity; Bezoutian; elimination; polynomial interpolation; integer polynomials; irreducibility criteria; location of roots; Lenstra-Lenstra-Lovász algorithm; Berlekamp's algorithm; Niederreiter's algorithm; discrete fast Fourier transform; Berlekamp-Zassenhaus algorithm; factorization of polynomials over the ring of integers; Kronecker's factorization method; polynomial sizes
68W30: Symbolic computation and algebraic computation
11Y16: Number-theoretic algorithms; complexity
11C08: Polynomials in number theory
12D05: Polynomials in real and complex fields: factorization
12E05: Polynomials in general fields (irreducibility, etc.)
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
11T06: Polynomials over finite fields
11-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory
13F25: Formal power series rings
12-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory
Related Items