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 19 items.
- A regularization approach for estimating the type of a plane curve singularity (Q385004) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- On the intrinsic complexity of point finding in real singular hypersurfaces (Q990944) (← links)
- Effective computation of singularities of parametric affine curves (Q1612159) (← links)
- Approximating rings of integers in number fields (Q1805356) (← links)
- Linear differential operators for polynomial equations (Q1864893) (← links)
- On resolution complexity of plane curves (Q1902047) (← links)
- Resolution of space curves complexity (Q1910760) (← links)
- Algorithms for the implementation of the analytic classification of plane branches (Q1930174) (← links)
- Computing the equisingularity type of a pseudo-irreducible polynomial (Q2025447) (← links)
- A quasi-linear irreducibility test in \(\mathbb{K}[[x]][y]\) (Q2149947) (← links)
- Algorithm for the semigroup of a space curve singularity (Q2505013) (← links)
- Computing resolution invariants of a cyclic surface singularity with MAPLE (Q2759229) (← links)
- A regularization method for computing approximate invariants of plane curves singularities (Q2819615) (← 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)
- (Q5494787) (← links)
