Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis
CoRR(2023)
摘要
We describe two algorithms for multiplying n x n matrices using time and
energy n^2 polylog(n) under basic models of classical physics. The first
algorithm is for multiplying integer-valued matrices, and the second, quite
different algorithm, is for Boolean matrix multiplication. We hope this work
inspires a deeper consideration of physically plausible/realizable models of
computing that might allow for algorithms which improve upon the runtimes and
energy usages suggested by the parallel RAM model in which each operation
requires one unit of time and one unit of energy.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要