张量压缩的算术复杂性
The arithmetic complexity of tensor contractions
摘要:
研究了张量演算的代数复杂性。我们考虑一个推广的迭代矩阵乘积张量,并表明由此产生的公式准确捕获VP,一类多项式族有效地计算算术电路。这给出了这个复杂性类的自然和鲁棒的表征,尽管它的自然性到目前为止还没有得到很好的理解。
英文摘要:
We investigate the algebraic complexity of tensor calulus. We consider a generalization of iterated matrix product to tensors and show that the resulting formulas exactly capture VP, the class of polynomial families efficiently computable by arithmetic circuits. This gives a natural and robust characterization of this complexity class that despite its naturalness is not very well understood so far.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。