Publication:4248251

zbMath0927.12004MaRDI QIDQ4248251

Maurice Mignotte, Doru Ştefănescu

Publication date: 7 June 1999

zbMATH Keywords

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

Mathematics Subject Classification ID

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

The black-box Niederreiter algorithm and its implementation over the binary field, A contraction of the Lucas polygon, Robustness and Randomness, Decomposition and Construction of Neighbourhood Operations Using Linear Algebra, An annulus for the zeros of polynomials, On the asymptotic and practical complexity of solving bivariate systems over the reals, Factoring polynomials over global fields, Bounds for the moduli of zeros., Recent progress in exact geometric computation, On the minimum of a positive polynomial over the standard simplex, Generalized radix representations and dynamical systems. IV, Lifting and recombination techniques for absolute factorization, Complexity of real root isolation using continued fractions, From an approximate to an exact absolute polynomial factorization, On the complexity of real root isolation using continued fractions, Theory of computational complexity. Part 9. Transl. from the Russian., Generalizations of Gonçalves' inequality