Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.016 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987189994 / rank | |||
Normal rank |
Revision as of 20:36, 19 March 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