The following pages link to (Q3776501):
Displaying 14 items.
- Generating approximate parametric roots of parametric polynomials (Q333108) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235) (← links)
- Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic (Q1358904) (← links)
- Computing tropical points and tropical links (Q1991344) (← links)
- Efficient estimation of roots from the field of fractional power series of a given polynomial in nonzero characteristic (Q2027325) (← links)
- Complexity of deciding whether a tropical linear prevariety is a tropical variety (Q2032307) (← links)
- On the estimation of coefficients of irreducible factors of polynomials over a field of formal power series in nonzero characteristic (Q2191317) (← links)
- Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic (Q2256714) (← links)
- A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
- An overview of effective normalization of a projective algebraic variety nonsingular in codimension one (Q2452949) (← 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)
- Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I (Q5369340) (← links)
