Lower bounds for the matrix chain ordering problem

Extended abstract
  • Phillip G. BradfordEmail author
  • Venkatesh Choppella
  • Gregory J. E. Rawlins
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 911)


We show for any n-matrix instance of the Matrix Chain Ordering Problem (MCOP) to have certain parenthesizations of depth Θ(n) as solutions requires the matrix dimensions that are input to be exponential in n. That is, to ensure the MCOP can have any parenthesization as a solution, we must allow very expensive inputs. This exponential input lower bound implies a worst case bit complexity lower bound of Ώ(n2). This lower bound is parameterized and, depending on the optimal product tree depth, it goes from Ώ(n2) down to Ώ(n lg n). Also, this paper gives a very simple Ώ(n lg n) time lower bound for the MCOP for a class of algorithms on a comparison model with unit cost comparisons. This lower bound, to the authors' knowledge, captures all known algorithms for solving the matrix chain ordering problem, but does not consider bit operations. Finally, a trade-off is given between the input complexity lower bound and the atomic comparison based lower bound.


Matrix Dimension Associative Product Vertex Weight Linear Product Optimal Triangulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.Google Scholar
  2. 2.
    S. Baase, Computer Algorithms: Introduction to Design and Analysis, Addison-Wesley, 1988.Google Scholar
  3. 3.
    P. G. Bradford, “Efficient Parallel Dynamic Programming (Extended Abstract),” Proceedings of the 30-th Allerton Conference on Communication, Control and Computation, University of Illinois at Urbana-Champaign, 185–194, 1992.Google Scholar
  4. 4.
    G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Prentice-Hall, 1988.Google Scholar
  5. 5.
    F. Y. Chin, “An O(n) Algorithm for Determining Near-Optimal Computation Order of Matrix Chain Products,” Communications of the ACM, Vol. 21, No. 7, 544–549, July 1978.CrossRefGoogle Scholar
  6. 6.
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, McGraw Hill, 1990.Google Scholar
  7. 7.
    A. Czumaj, “An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications,” Scandinavian Workshop on Algorithms Theory (SWAT), Springer Verlag, Lecture Nodes in Computer Science # 621, 62–72, 1992.Google Scholar
  8. 8.
    L. E. Deimel Jr. and T. A. Lampe, “An Invariance Theorem Concerning Optimal Computation of Matrix Chain Products,” North Carolina State Univ., TR79, No. 14, 1979.Google Scholar
  9. 9.
    A. Gibbons and W. Rytter, Introduction to Parallel Algorithms, Cambridge University Press, 1988.Google Scholar
  10. 10.
    E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, 1978.Google Scholar
  11. 11.
    T. C. Hu, Combinatorial Algorithms, Addison-Wesley, 1982.Google Scholar
  12. 12.
    T. C. Hu and M. T. Shing, “An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon,” Journal of Algorithms, Vol. 2, 122–138, 1981.CrossRefGoogle Scholar
  13. 13.
    T. C. Hu and M. T. Shing, “Some Theorems about Matrix Multiplication,” Proceedings of the 21-st Annual IEEE Symposium on the Foundations of Computer Science, IEEE Press, 28–35, 1980.Google Scholar
  14. 14.
    T. C. Hu and M. T. Shing, “Computation of Matrix Product Chains. Part I,” SIAM J. on Computing, Vo. 11, No. 3, 362–373, 1982.Google Scholar
  15. 15.
    T. C. Hu and M. T. Shing, “Computation of Matrix Product Chains. Part II,” SIAM J. on Computing, Vol. 13, No. 2, 228–251, 1984.Google Scholar
  16. 16.
    V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing, Benjamin/Cummings, 1994.Google Scholar
  17. 17.
    M. Marcus, Introduction to Modern Algebra, Marcel Dekker, 1978.Google Scholar
  18. 18.
    C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1982.Google Scholar
  19. 19.
    F. P. Preparata and M. I. Shamos, Computational Geometry—An Introduction, Springer Verlag, 1985.Google Scholar
  20. 20.
    P. W. Purdom Jr. and C. A. Brown, The Analysis of Algorithms, Holt, Rinehart and Winston, 1985.Google Scholar
  21. 21.
    P. Ramanan, “A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangularization Problem,” Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, 281–290, 1991.Google Scholar
  22. 22.
    P. Ramanan, “A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangularization Problem,” SIAM J. on Computing, Vol. 23, No. 4, 834–851, August 1994.Google Scholar
  23. 23.
    R. Sedgewick, Algorithms, Addision-Wesley, Second Edition, 1989.Google Scholar
  24. 24.
    A. C.-C. Yao, “Lower bounds for Algebraic Computation Trees with Integer Inputs,” SIAM J. on Computing, Vol. 20, No. 4, 655–668, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Phillip G. Bradford
    • 1
    Email author
  • Venkatesh Choppella
    • 2
  • Gregory J. E. Rawlins
    • 2
  1. 1.Max-Planck-Institut für Informatik, Im StadtwaldSaarbrückenGermany
  2. 2.Computer Science DepartmentIndiana UniversityBloomingtonUSA

Personalised recommendations