An Algorithm for Parallel Evaluation of Functions

Abstract A technique is shown for speeding up parallel evaluation of functions. An algorithm is presented that evaluates powers xn in time O(√log n) using O(n) processors and certain preprocessed data, while the known algorithms take [log2 n] steps of multiplication or addition.