Pages that link to "Item:Q3203147"
From MaRDI portal
The following pages link to The Computational Complexity of the Resolution of Plane Curve Singularities (Q3203147):
Displaying 9 items.
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Approximating rings of integers in number fields (Q1805356) (← links)
- Linear differential operators for polynomial equations (Q1864893) (← links)
- Computing the equisingularity type of a pseudo-irreducible polynomial (Q2025447) (← links)
- A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) (Q2149947) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- A Polynomial Time Complexity Bound for Computations on Curves (Q4210172) (← links)
- A fast algorithm for curve singularities (Q4822746) (← links)
- Irreducibility criterion for algebroid curves (Q4911915) (← links)
