Abstract
The parallel complexity of iterated multiplication in an arbitrary but fixed ring of algebraic integers is studied. Boolean circuits of fan-in 2 are used. It is shown that polynomial time uniform circuits of logdepth can be constructed to solve this problem algorithmically.
Research was supported in part by the Heisenberg Programm der Deutschen Forschungsgemeinschaft, Bonn.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. W. Beame, S. A. Cook, H. J. Hoover, Logdepth circuits for division and related problems, SIAM J. Computing 1986, 15(4), pp. 993–1003.
A. Borodin, S. A. Cook, N. Pippenger, Parallel computation for well-endowed rings and space bounded probabilistic machines, TR 162/83, University of Toronto.
S. A. Cook, The classification of problems which have fast parallel algorithms, in: Lecture Notes in Computer Sci. 158, Springer-Verlag, Berlin, 1983.
S. A. Cook, A taxonomie of problems with fast parallel algorithms, Information and Control 1985, 64. pp. 2–22.
S. A. Cook, P. McKenzie, The parallel complexity of abelian permutation group problems, SIAM J. Computing 1987, 16(2) pp. 880–909.
S. A. Cook, P. McKenzie, Problems complete for deterministic logspace, J. of Algorithms 1987, 8 pp. 385–394.
J. E. Hopcroft, J. D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, Reading, 1979.
S. Lang, Algebra, Addison-Wesley, Reading 1965
J. H. Reif, Logarithmic depth circuits for algebraic functions, SLAM J. Computing 1986, 15 (1), pp. 231–242.
J. H. Reif, S. Tate, Optimal size integer division circuits, in: Proc. 21st ACM STOC 1989, pp. 264–273.
V. Pan, Complexity of computations with matrices and polynomials, SIAM review 1992, 34-2, pp. 225–262.
W. L. Ruzzo, On uniform circuit complexity, J. Comput. System Sci. 1981, 22, pp.365–383.
J. E. Savage, The complexity of computing, John Wiley, New York 1976.
I. Wegener, The complexity of Boolean functions, Wiley-Teubner Series in Comput. Sci., 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Waack, S. (1994). On the parallel complexity of iterated multiplication in rings of algebraic integers. In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-58078-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58078-2
Online ISBN: 978-3-540-48435-6
eBook Packages: Springer Book Archive