可高效验证的强唯一可解谜题与矩阵乘法
Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication
AI总结:
本文提出并分析可简化 SUSP,证明其可高效验证且单个谜题即可达到无限族的 ω 界,并通过计算机搜索将矩阵乘法指数上界从 2.66 改进至 2.505。
摘要:
我们推进了用于开发快速矩阵乘法算法的 Cohn-Umans 框架。我们引入、分析并搜索了一类新的强唯一可解谜题(SUSP)子类,我们称之为可简化 SUSP。我们证明这些谜题可以被高效验证,而对于一般 SUSP 而言,这仍是一个开放问题。我们还表明,单个可简化 SUSP 能够达到无限 SUSP 族所能达到的关于矩阵乘法指数 ω 的同等强度界。我们报告了通过计算机搜索构造出的、在小宽度下比此前已知更大的 SUSP。结合我们更紧密的分析,这将可通过该计算方法获得的矩阵乘法指数上界从 2.66 加强到 2.505,并接近 Cohn 等人手工构造的结果。
英文摘要:
We advance the Cohn-Umans framework for developing fast matrix multiplication algorithms. We introduce, analyze, and search for a new subclass of strong uniquely solvable puzzles (SUSP), which we call simplifiable SUSPs. We show that these puzzles are efficiently verifiable, which remains an open question for general SUSPs. We also show that individual simplifiable SUSPs can achieve the same strength of bounds on the matrix multiplication exponent $ω$ that infinite families of SUSPs can. We report on the construction, by computer search, of larger SUSPs than previously known for small width. This, combined with our tighter analysis, strengthens the upper bound on the matrix multiplication exponent from $2.66$ to $2.505$ obtainable via this computational approach, and nears the results of the handcrafted constructions of Cohn et al.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。