Highly Parallel Computations Modulo a Number Having Only Small Prime Factors Author: Thomas Zeugmann Source: Information and Computation 96, No. 1, 1992, 95 - 114. Abstract. Highly parallel algorithms computing the inverse, discrete roots, or a large power modulo a number that has only small prime factors are presented. The elaborated uniform families of Boolean circuits simulataneously achive depth and size for P-uniformity and depth and size for log-space uniformity. ©Copyright 1992 Academic Press, Inc.