scientific article
From MaRDI portal
Publication:3776501
zbMath0636.65043MaRDI QIDQ3776501
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Related Items (14)
Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic ⋮ Generating approximate parametric roots of parametric polynomials ⋮ On the estimation of coefficients of irreducible factors of polynomials over a field of formal power series in nonzero characteristic ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I ⋮ An overview of effective normalization of a projective algebraic variety nonsingular in codimension one ⋮ Computing tropical points and tropical links ⋮ Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic ⋮ Efficient estimation of roots from the field of fractional power series of a given polynomial in nonzero characteristic ⋮ Complexity of deciding whether a tropical linear prevariety is a tropical variety ⋮ A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function ⋮ Irreducibility testing over local fields ⋮ Complexity of factoring and calculating the GCD of linear ordinary differential operators ⋮ A numerical realization of the conditions of Max Nöther's residual intersection theorem
This page was built for publication: