arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0902.2407cs.CCcs.SC
收藏

群论部分矩阵乘法

Group-Theoretic Partial Matrix Multiplication

Richard Strong Bowen, Bo Chen, Hendrik Orem, Martijn van Schaardenburg

摘要:

最近的群论矩阵乘法算法的模拟部分矩阵乘法理论的推广。我们表明,这种方法增加的灵活性,在某些情况下,可以提高上界的指数矩阵乘法群论全矩阵乘法。我们的部分矩阵乘法算法背后的群论导致的问题,最大化的数量表示的“丰满”的一个给定的部分矩阵模式。这个问题被证明是NP-困难的,并给出了两个算法,一个最优的和另一个非最优的,但多项式时间,解决它。

英文摘要:

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve upper bounds on the exponent of matrix multiplication yielded by group-theoretic full matrix multiplication. The group theory behind our partial matrix multiplication algorithms leads to the problem of maximizing a quantity representing the "fullness" of a given partial matrix pattern. This problem is shown to be NP-hard, and two algorithms, one optimal and another non-optimal but polynomial-time, are given for solving it.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑