关于对称矩阵Kronecker幂覆盖复杂性的注记
Notes on the complexity of coverings for Kronecker powers of symmetric matrices
摘要:
本文研究了最近由J. Alman,Y. Guan、黑冠草A. Padaki [arXiv,2022].我们提供了另一种证明的情况下,对称矩阵在一个更强的形式。因此,先前已知的布尔$N\times N$ Kneser-Sierpinski矩阵的深度2加性复杂度的上界被改进为$O(N^{1.251})$。
英文摘要:
In the present note, we study a new method of constructing efficient coverings for Kronecker powers of matrices, recently proposed by J. Alman, Y. Guan, A. Padaki [arXiv, 2022]. We provide an alternative proof for the case of symmetric matrices in a stronger form. As a consequence, the previously known upper bound on the depth-2 additive complexity of the boolean $N\times N$ Kneser-Sierpinski matrices is improved to $O(N^{1.251})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。