By Topic

On the Parallel Evaluation of Polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
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-δcan be evaluated, where C= √2 and δ ≈ √2s. This implies polynomials of degree can be evaluated in log2n+√2log2n +0(1) steps. Various techniques for the evaluation of polynomials in a "reasonable number" of "steps" are compared with the known lower bounds.

Published in:

IEEE Transactions on Computers  (Volume:C-22 ,  Issue: 1 )