scientific article

zbMath0498.12019MaRDI QIDQ3963114

Maurice Mignotte

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomialscomputer algebrameasurecoefficients of divisorsminimal distance between rootsmoduli of roots

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Numerical computation of solutions to single equations (65H05) Polynomials (irreducibility, etc.) (11R09) Polynomials and rational functions of one complex variable (30C10) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (31)

Integral polynomials with small discriminants and resultants ⋮ A modular method for computing the Galois groups of polynomials ⋮ A parallel multi-modular algorithm for computing Lagrange resolvents ⋮ GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation ⋮ Positive root isolation for poly-powers by exclusion and differentiation ⋮ On the complexity of computing the greatest common divisor of several univariate polynomials ⋮ Computing eigenvalues of semi-infinite quasi-Toeplitz matrices ⋮ On the computing time of the continued fractions method ⋮ Computing primitive elements of extension fields ⋮ An inequality for the norm of a polynomial factor ⋮ New bounds for the Descartes method ⋮ Polynomial root separation examples ⋮ Cook's versus Valiant's hypothesis ⋮ Detecting cusps and inflection points in curves ⋮ Distances from differences of roots of polynomials to the nearest integers ⋮ Root separation for trinomials ⋮ Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares ⋮ Detecting algebraic curves in bad position ⋮ On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture ⋮ Polynomial minimum root separation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The computation of polynomial greatest common divisors over an algebraic number field ⋮ Unnamed Item ⋮ Spécialisation de la suite de Sturm et sous-résultants (I) ⋮ First-order orbit queries ⋮ Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. ⋮ Complexity of computation on real algebraic numbers ⋮ Real root isolation for exp-log-arctan functions ⋮ Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem ⋮ Computing partial information out of intractable: powers of algebraic numbers as an example

This page was built for publication: