Pages that link to "Item:Q4955867"

The following pages link to A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function (Q4955867):

Displaying 16 items.

• Generating approximate parametric roots of parametric polynomials (Q333108) (← links)
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
• Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (Q540325) (← links)
• Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
• Explicit construction of integral bases of radical function fields (Q614490) (← links)
• Good reduction of Puiseux series and applications (Q654032) (← links)
• Rational solutions of ordinary difference equations (Q950423) (← links)
• Computing the equisingularity type of a pseudo-irreducible polynomial (Q2025447) (← links)
• A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) (Q2149947) (← links)
• A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
• Curves testing boundedness of polynomials on subsets of the real plane (Q2437228) (← links)
• Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
• Factoring polynomials over global fields. II. (Q2456609) (← links)
• A Polynomial Time Complexity Bound for Computations on Curves (Q4210172) (← links)
• Computing all integer solutions of a genus 1 equation (Q4417168) (← links)
• On the complexity of analyticity in semi-definite optimization (Q6118356) (← links)