Abstract
Very fast parallel algorithms computing the inverse and large powers of polynomials over finite fields are presented provided the modulus has only small prime factors. The elaborated uniform families of Boolean circuits simultaneously achieve depth O(log n) and size O(no(1)) for P-uniformity and depth O(log n loglog n) and size O(no(1)) for log-space uniformity.
Preview
Unable to display preview. Download preview PDF.
5. References
Borodin, A., On relating time and space to size and depth. SIAM J. Comp. 6, (1977), 733–744.
Cook, S.A., A taxonomy of problems with fast parallel algorithms. Information and Control 64, (1985), 2–22.
Eberly, W., Very fast matrix and polynomial arithmetic. Proc. 25th Annual Symp. on Foundations of Computer Science, IEEE (1984), pp. 21–30.
Fich, F.E. and M. Tompa, The parallel complexity of exponentiating polynomials over finite fields. J. Assoc. Comp. Mach. 35, 651–667
von zur Gathen, J., Parallel algorithms for algebraic problems. SIAM J. Comp. 13, (1984), 802–824.
von zur Gathen, J., Parallel arithmetic computations: a survey. Proc. 12th Internat. Symp. Math. Foundations of Computer Science, Bratislava 1986, Lecture Notes in Computer Science 233, pp. 93–112, Springer.
von zur Gathen, J., Computing powers in parallel. SIAM J. Comp. 16, (1987), 930–945.
Litow, B.E. and G.I. Davida, O(log n) parallel time finite field inversion, Proc. Aegean Workshop on Computing, (1988) Lecture Notes in Computer Science 319, pp. 74–80, Springer.
Reif, J.M. and S.R. Tate, Optimal size integer division circuits, Proc. 21th Annual ACM Symposium on Theory of Computing, Seattle, (1989), pp. 264–273.
Reischuk, R., Parallele Maschinenmodelle und Komplexitätsklassen, Informationstechnik it 31, (1989), 59–77.
Zeugmann, T., Parallel algorithms. (1990), Encyclopedia of Computer Science and Technology, Vol. 21, Supplement 6, Allen Kent and James G. Williams (Eds.), pp. 223–244, Marcel Dekker Inc., New York and Basel.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zeugmann, T. (1990). Computing large polynomial powers very fast in parallel. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029653
Download citation
DOI: https://doi.org/10.1007/BFb0029653
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive