All Algebraic Functions Can Be Computed Fast

Cited in

(34)

On computation of a power series root with arbitrary degree of convergence
On expansion of algebraic functions in power and Puiseux series. I
On expansion of algebraic functions in power and Puiseux series. II
Differentiably finite power series
The multi-indexed partitional
Solving multivariate algebraic equation by Hensel construction
Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
Generating power of lazy semantics
Relax, but don't be too lazy
A study of approximate polynomials. I: Representation and arithmetic
Hensel construction with an arbitrary degree of convergence
Analytic continuation and Riemann surface determination of algebraic functions by computer
Computing Puiseux series: a fast divide and conquer algorithm
On the extended Hensel construction and its application to the computation of real limit points
A numerical realization of the conditions of Max Nöther's residual intersection theorem
The Computational Complexity of the Resolution of Plane Curve Singularities
A symbolic computation approach towards the asymptotic stability analysis of differential systems with commensurate delays
Generating approximate parametric roots of parametric polynomials
scientific article; zbMATH DE number 4146129 (Why is no real title available?)
Analytic Equations and Singularities of Plane Curves
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
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
On the complexity of symmetric polynomials
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
A new method to obtain lower bounds for polynomial evaluation
On the complexity of analyticity in semi-definite optimization
Fast coefficient computation for algebraic power series in positive characteristic
Good reduction of Puiseux series and applications
Polynomial complexity algorithms for computational problems in the theory of algebraic curves
Plane curve germs and contact factorization
On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation
Multivariate polynomial perturbations of algebraic equations

This page was built for publication: All Algebraic Functions Can Be Computed Fast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4147592)