External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Average-Case Complexity of the Min-Sum Matrix Product Problem

Ken Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan. Average-Case Complexity of the Min-Sum Matrix Product Problem. In Hee-Kap Ahn, Chan-Su Shin, editors, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Volume 8889 of Lecture Notes in Computer Science, pages 41-52, Springer, 2014. [doi]

Authors

Ken Fong

This author has not been identified. Look up 'Ken Fong' in Google

Minming Li

This author has not been identified. Look up 'Minming Li' in Google

Hongyu Liang

This author has not been identified. Look up 'Hongyu Liang' in Google

Linji Yang

This author has not been identified. Look up 'Linji Yang' in Google

Hao Yuan

This author has not been identified. Look up 'Hao Yuan' in Google
runs on