On Obtaining Upper Bounds on the Complexity of Matrix Multiplication

Charles M. Fiduccia. On Obtaining Upper Bounds on the Complexity of Matrix Multiplication. In Raymond E. Miller, James W. Thatcher, editors, Proceedings of a symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York. The IBM Research Symposia Series, pages 31-40, Plenum Press, New York, 1972.

Abstract

Abstract is missing.