首页 | 本学科首页   官方微博 | 高级检索  
     


Lower bounds for the multiplicative complexity of matrix multiplication
Authors:M Bläser
Affiliation:Institut für Informatik II, Universit?t Bonn, R?merstr. 164, 53117 Bonn, Germany, DE
Abstract:We prove a lower bound of km + mn + km + n— 3 for the multiplicative complexity of the multiplication of -matrices with -matrices using the substitution method. Received: July 8, 1997.
Keywords:, Matrix multiplication, multiplicative complexity, lower bound, substitution method,
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号