The parallel complexity of arithmetic computation

  • J. Ian Munro
Section C Computability, Decidability & Arithmetic Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Results on the computational complexity of performing several standard types of arithmetic computations in a parallel processing environment are surveyed. The essential equivalence of matrix inversion and the problem of computing the nth power of a matrix in the parallel setting is demonstrated as evidence suggesting an interesting lower bound on the inversion problem. A number of open problems are suggested.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barak, A., F. Preparata and D. Muller, "Reducing the Depth of Boolean Expressions", Proc. CMU Conference on Algorithms and Computing; New Directions and Recent Results, April 1976, Abstract only.Google Scholar
  2. 2.
    Borodin, A., and I. Munro, The Computational Complexity of Algebraic and Numeric Problems, American Elsevier, New York, 1975.Google Scholar
  3. 3.
    Brauer, A. "On Addition Chains", Bull. AMS, vol. 45, pp. 736–739.Google Scholar
  4. 4.
    Brent, R.P., "On the Addition of Binary Numbers", IEEE Trans. on Computers, (Aug. 1970), pp. 758–759.Google Scholar
  5. 5.
    —, "The Parallel Evaluation of General Arithmetic Expressions", JACM, vol. 21, no. 2, April, pp. 201–206.Google Scholar
  6. 6.
    Csanky, L., "On the Parallel Complexity of Some Computational Problems", Ph.D. Thesis, Dept. EECS, University of California at Berkeley.Google Scholar
  7. 7.
    —, "Fast Parallel Matrix Inversion Algorithms", SICOMP (5,4) (Dec. 1976) pp. 618–623.Google Scholar
  8. 8.
    Erdös, P., "Remarks on Number Theory III — On Addition Chains", Acta Arithmetica, vol. 6, pp. 77–81.Google Scholar
  9. 9.
    Estrin, G., "Organization of Computer Systems — The Fixed Variable Structure Computer", Proc. Western Joint Conference, no. 5, pp. 33–40.Google Scholar
  10. 10.
    Gentleman, W.M., "Some Complexity Results for Matrix Computations on Parallel Computers", to appear JACM.Google Scholar
  11. 11.
    Heller, E., "A Determinant Theorem with Applications to Parallel Algorithms", Dept. of Computer Science Tech. Report, Carnegie-Mellon University.Google Scholar
  12. 12.
    —, D.K. Stevenson, and J.F. Traub, "Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers", JACM (23,4) (Oct. 1976), pp. 636–654.Google Scholar
  13. 13.
    Kung, H.T., "Some Complexity Bounds for Parallel Computation", Proc. of 6th Annual ACM Symp. on Theory of Computing, pp. 323–333.Google Scholar
  14. 14.
    Kowalenko, A., The Parallel Computational Complexity of Some Numeric Problems, M. Math Thesis, University of Waterloo. (April 1976)Google Scholar
  15. 15.
    Lipton, R.J., Personal Communication.Google Scholar
  16. 16.
    Maruyama, K.M., "On the Parallel Evaluation of Polynomials", IEEE Trans. on Computers, C-22, pp. 2–5.Google Scholar
  17. 17.
    Muller, D.F., and F.P. Preparata, "Restructuring of Arithmetic Expressions for Parallel Evaluation", JACM (23,3) (July 1976), pp. 534–543.Google Scholar
  18. 18.
    Munro, I., and M. Paterson, "Optimal Algorithms for Parallel Polynomial Evaluation", Journal of Computer and System Sciences, vol. 7, no. 2, pp. 189–198.Google Scholar
  19. 19.
    Santoro, N., Unpublished manuscript.Google Scholar
  20. 20.
    Stone, H.S., "An Efficient Parallel Algorithm for the Solution of a Tridiagonal System of Equations", JACM, vol. 20, no. 1, pp. 27–38.Google Scholar
  21. 21.
    Strassen, V., "Gaussian Elimination is Not Optimal", Numerische Mathematik, vol. 13, pp. 354–356.Google Scholar
  22. 22.
    Winograd, S., "Parallel Iteration Methods", in R.E. Miller and J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, pp. 53–60.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • J. Ian Munro
    • 1
  1. 1.Department of Computer ScienceUniversity of WaterlooCanada

Personalised recommendations