Pages that link to "Item:Q4918038"

The following pages link to Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038):

Displaying 3 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)