二次时间与能量下的矩阵乘法?迈向细粒度的以能量为中心的丘奇-图灵论题
Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis
AI总结:
本研究在经典物理基本模型下提出两种n² polylog(n)时间与能耗的n×n矩阵乘法算法(分别针对整数矩阵与布尔矩阵),旨在推动探索物理可实现的、能效和运行效率优于并行RAM模型的计算模型。
摘要:
我们在经典物理学的基本模型下,提出两种时间与能量开销均为n² polylog(n)的n×n矩阵乘法算法。第一种算法用于整数值矩阵乘法,第二种截然不同的算法用于布尔矩阵乘法。我们希望本研究能推动学界更深入地考量物理上合理/可实现的计算模型,这类模型或许能让算法在运行时间和能耗上优于并行RAM模型(该模型中每次操作需消耗一单位时间和一单位能量)。
英文摘要:
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分析而来,可能存在错误,请以论文正文为准。