The following pages link to (Q4194438):
Displaying 7 items.
- A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
- Some parallel methods for polynomial root-finding (Q1091080) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- Detecting cusps and inflection points in curves (Q1195058) (← links)
- Computing the irreducible real factors and components of an algebraic curve (Q1814128) (← links)
- The fundamental theorem of algebra and complexity theory (Q3904686) (← links)
- On searching for roots of a polynomial in a circular annulus (Q5286062) (← links)
