Pages that link to "Item:Q4147592"

The following pages link to All Algebraic Functions Can Be Computed Fast (Q4147592):

Displaying 33 items.

• Generating approximate parametric roots of parametric polynomials (Q333108) (← links)
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
• Good reduction of Puiseux series and applications (Q654032) (← links)
• Polynomial complexity algorithms for computational problems in the theory of algebraic curves (Q684961) (← links)
• On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds (Q760006) (← links)
• On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation (Q831966) (← links)
• Multivariate polynomial perturbations of algebraic equations (Q982585) (← links)
• On computation of a power series root with arbitrary degree of convergence (Q1002491) (← links)
• On expansion of algebraic functions in power and Puiseux series. I (Q1094132) (← links)
• On expansion of algebraic functions in power and Puiseux series. II (Q1109930) (← links)
• Differentiably finite power series (Q1145145) (← links)
• The multi-indexed partitional (Q1257896) (← links)
• Solving multivariate algebraic equation by Hensel construction (Q1301578) (← links)
• Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries (Q1325135) (← links)
• Generating power of lazy semantics (Q1389632) (← links)
• Relax, but don't be too lazy (Q1866999) (← links)
• A study of approximate polynomials. I: Representation and arithmetic (Q1895002) (← links)
• Hensel construction with an arbitrary degree of convergence (Q1922224) (← links)
• Analytic continuation and Riemann surface determination of algebraic functions by computer (Q1922269) (← links)
• Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
• On the extended Hensel construction and its application to the computation of real limit points (Q2284954) (← links)
• A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
• The Computational Complexity of the Resolution of Plane Curve Singularities (Q3203147) (← links)
• A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays (Q3297392) (← links)
• (Q3476962) (← links)
• Analytic Equations and Singularities of Plane Curves (Q4187910) (← links)
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function (Q4955867) (← links)
• Irreducibility testing over local fields (Q4955868) (← links)
• (Q5090425) (← links)
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
• A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)
• On the complexity of analyticity in semi-definite optimization (Q6118356) (← links)
• Fast coefficient computation for algebraic power series in positive characteristic (Q6165860) (← links)