Pages that link to "Item:Q4918038"
From MaRDI portal
The following pages link to Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038):
Displaying 4 items.
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- Path lengths in tree-child time consistent hybridization networks (Q845330) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences (Q5237090) (← links)
