Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:41, 8 February 2024
scientific article; zbMATH DE number 6160454
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra |
scientific article; zbMATH DE number 6160454 |
Statements
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (English)
0 references
3 May 2013
0 references
subdivision schemes
0 references
global methods
0 references
factorization approach
0 references
constructive proofs
0 references
