Computing Large Polynomial Powers Very Fast in Parallel

Author: Thomas Zeugmann

Source: "Proc. Mathematical Foundations of Computer Science," August 1990, B. Rovan (Ed.), Lecture Notes in Computer Science 452, pp. 538 - 544, Springer-Verlag 1990.

Abstract. Very fast parallel algorithms computing the inverse and large powers of polynomials over small finite fields are presented. The elaborated uniform families of Boolean circuits simulataneously achive depth tex2html_wrap_inline8 and size tex2html_wrap_inline10 for P-uniformity and depth tex2html_wrap_inline8 and size tex2html_wrap_inline8 for log-space uniformity.

©Copyright 1990, Springer-Verlag