谁可以告诉我的加法和放大器的复杂性;减法的分割和放大器;征服矩阵乘法算法？ [英] Can someone tell me the Complexity of the Addition & Subtraction for the Divide & Conquer Matrix Multiplication algorithm?

问题描述

有人可以告诉我的加成和放大器的复杂性;减法的分割和放大器;征服矩阵乘法算法？

Can someone tell me the Complexity of the Addition & Subtraction for the Divide & Conquer Matrix Multiplication algorithm?

我知道，经典的矩阵乘法加法和减法运算的复杂性是（N ^ 3-N ^ 2），而施特拉森的是6N ^ 2.81 - 6N ^ 2 ...但我似乎无法找到分割和放大器;征服任何地方。只是想，如果任何人都会知道，你们会。谢谢

I know that the complexities of addition and subtraction operations of the Classic matrix multiplication are (n^3-n^2) while Strassen’s is 6n^2.81 – 6n^2... but I can't seem to find the Divide & Conquer anywhere. Just figure if anyone would know, you guys would. Thanks

推荐答案

的这可能的帮助。查看施特拉森的方法出台前部分。

This might help. See the introduction section before the Strassen's Method.

这篇关于谁可以告诉我的加法和放大器的复杂性;减法的分割和放大器;征服矩阵乘法算法？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！