Tamrazov, P. M. Smale’s polynomial problem. (Russian. English summary) Zbl 1249.12001 Dopov. Nats. Akad. Nauk Ukr., Mat. Pryr. Tekh. Nauky 2011, No. 12, 24-27 (2011). Summary: The paper deals with the problem of the best majorization of an algorithm characteristic posed by S. Smale [Bull. Am. Math. Soc., New Ser. 4, 1–36 (1981; Zbl 0456.12012)]. The exact values of the characteristic itself are found. MSC: 12D10 Polynomials in real and complex fields: location of zeros (algebraic theorems) 30D10 Representations of entire functions of one complex variable by series and integrals 65H05 Numerical computation of solutions to single equations 68Q25 Analysis of algorithms and problem complexity Keywords:Smale polynomial problem; majorization Citations:Zbl 0456.12012 PDFBibTeX XMLCite \textit{P. M. Tamrazov}, Dopov. Nats. Akad. Nauk Ukr., Mat. Pryr. Tekh. Nauky 2011, No. 12, 24--27 (2011; Zbl 1249.12001)