Publication:4002529

zbMath0741.11002MaRDI QIDQ4002529

Maurice Mignotte

Publication date: 18 September 1992

zbMATH Keywords

complexity; polynomials; factorization; primality

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

11-02: Research exposition (monographs, survey articles) pertaining to number theory

12D10: Polynomials in real and complex fields: location of zeros (algebraic theorems)

11T06: Polynomials over finite fields

68-02: Research exposition (monographs, survey articles) pertaining to computer science

13P05: Polynomials, factorization in commutative rings

11Y05: Factorization

11Y11: Primality

12-02: Research exposition (monographs, survey articles) pertaining to field theory

Related Items

Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases, Non-trivial quadratic approximations to zero of a family of cubic Pisot numbers, On a New Factorization Algorithm for Polynomials Over Finite Fields, Counting solutions to trinomial Thue equations: a different approach, A contraction of the Lucas polygon, Distinct Degree Factorizations for Polynomials over a Finite Field, Detecting algebraic curves in bad position, Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy, Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions, On the zeroes of two families of polynomials arising from certain rational integrals, Graph compression and the zeros of polynomials, Bounds for resultants of univariate and bivariate polynomials, On new higher order families of simultaneous methods for finding polynomial zeros, Parametric mixed-integer 0-1 linear programming: The general case for a single parameter, Exotic quantifiers, complexity classes, and complete problems, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], Enumeration of special sets of polynomials over finite fields, Factoring polynomials over arbitrary finite fields, Algorithms for residues and Łojasiewicz exponents, Various new expressions for subresultants and their applications, Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices, Testing reducibility of linear differential operators: A group theoretic perspective, \(p\)-irreducibility of binding polynomials, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, A separation bound for real algebraic expressions, Polynomial root separation examples, Galois theory, splitting fields and computer algebra, Splitting fields for characteristic polynomials of matrices with entries in a finite field, Distance bounds of \(\varepsilon\)-points on hypersurfaces, Exact, efficient, and complete arrangement computation for cubic curves, An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials, Some computations on the spectra of Pisot and Salem numbers, On the location of critical points of polynomials, On efficient computation and asymptotic sharpness of Kalantari’s bounds for zeros of polynomials, Much Ado about Zero, Computing automorphisms of abelian number fields