All Algebraic Functions Can Be Computed Fast
From MaRDI portal
Publication:4147592
DOI10.1145/322063.322068zbMath0371.68019OpenAlexW2003699415MaRDI QIDQ4147592
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/All_algebraic_functions_can_be_computed_fast/6603137
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation, On expansion of algebraic functions in power and Puiseux series. I, A study of approximate polynomials. I: Representation and arithmetic, Generating approximate parametric roots of parametric polynomials, Analytic Equations and Singularities of Plane Curves, On expansion of algebraic functions in power and Puiseux series. II, Hensel construction with an arbitrary degree of convergence, Analytic continuation and Riemann surface determination of algebraic functions by computer, Generating power of lazy semantics, On the complexity of analyticity in semi-definite optimization, Differentiably finite power series, Fast coefficient computation for algebraic power series in positive characteristic, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, Good reduction of Puiseux series and applications, A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays, Polynomial complexity algorithms for computational problems in the theory of algebraic curves, A new method to obtain lower bounds for polynomial evaluation, Multivariate polynomial perturbations of algebraic equations, Unnamed Item, On the extended Hensel construction and its application to the computation of real limit points, The Computational Complexity of the Resolution of Plane Curve Singularities, 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 computation of a power series root with arbitrary degree of convergence, The multi-indexed partitional, Unnamed Item, On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds, Computing Puiseux series: a fast divide and conquer algorithm, Solving multivariate algebraic equation by Hensel construction, A numerical realization of the conditions of Max Nöther's residual intersection theorem, Relax, but don't be too lazy, Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
