布尔矩阵乘法组合算法的下界
Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication
摘要:
本文提出了布尔矩阵乘法(BMM)的组合算法模型,并证明了在这些模型中计算BMM的下界。首先,我们给出了一个相对宽松的组合模型,它是Angluin(1976)模型的推广,并证明了BMM的任何算法所需的时间至少为$Ω(n^3 / 2^{O( \sqrt{ \log n })})$。随后,我们提出了一个更一般的模型,能够模拟“四个俄罗斯算法”。在此模型下,我们证明了BMM的$Ω(n^{7/3} / 2^{O(\sqrt{ \log n })})$的一个下界。我们使用一类特殊的图,称为$(r,t)$ -图,最初由Rusza和Szemeredi(1978)发现,以及随机化,来构造矩阵,这些矩阵是我们的组合模型的硬实例。
英文摘要:
In this paper we propose models of combinatorial algorithms for the Boolean Matrix Multiplication (BMM), and prove lower bounds on computing BMM in these models. First, we give a relatively relaxed combinatorial model which is an extension of the model by Angluin (1976), and we prove that the time required by any algorithm for the BMM is at least $Ω(n^3 / 2^{O( \sqrt{ \log n })})$. Subsequently, we propose a more general model capable of simulating the "Four Russians Algorithm". We prove a lower bound of $Ω(n^{7/3} / 2^{O(\sqrt{ \log n })})$ for the BMM under this model. We use a special class of graphs, called $(r,t)$-graphs, originally discovered by Rusza and Szemeredi (1978), along with randomization, to construct matrices that are hard instances for our combinatorial models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。