Login / Signup

On Obtaining Upper Bounds on the Complexity of Matrix Multiplication.

Charles M. Fiduccia
Published in: Complexity of Computer Computations (1972)
Keyphrases
  • upper bound
  • matrix multiplication
  • worst case
  • lower bound
  • computational complexity
  • upper and lower bounds
  • message passing
  • distributed memory
  • higher order
  • average case
  • efficiently computable