An I/O-Complexity Lower Bound for All Recursive Matrix Multiplication Algorithms by Path-Routing

Author:

Jacob Scott

Publication date:

December 1, 2015

Publication type:

PhD Thesis (Author field refers to student + advisor)

Topics

Past PhDs topic page, PhD-year-2015 topic page