SIAM Journal on Numerical Analysis, Vol. 11, No. 6 (Dec., 1974), pp. 1087-1104 (18 pages) A composite algorithm has been designed for finding zeros of real polynomials. The algorithm has proved to be ...
Let N*(m) be the minimal length of a polynomial with ± 1 coefficients divisible by $(x - 1)^m$. Byrnes noted that $N^{*}(m) \leq 2^m$ for each m, and asked whether ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback