This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January 1973 (vol. 22 no. 1)
pp. 2-5
K. Maruyama, Department of Computer Science, University of Illinois
If an unlimited number of processors is available, then for any given number of steps s, s=1, polynomials of degree as large as C2n-dcan be evaluated, where C= v2 and d ? v2s. This implies polynomials of degree can be evaluated in log2n+v2log2n +0(1) steps. Various techniques for the evaluation of polynomials in a "reasonable number" of "steps" are compared with th
Index Terms:
Parallel algorithms, polynomial evaluation.
Citation:
K. Maruyama, "On the Parallel Evaluation of Polynomials," IEEE Transactions on Computers, vol. 22, no. 1, pp. 2-5, Jan. 1973, doi:10.1109/T-C.1973.223593
Usage of this product signifies your acceptance of the Terms of Use.