The Complexity of Tensor Rank
Theory of Computing Systems(2017)
摘要
We show that determining the rank of a tensor over a field has the same complexity as deciding the existential theory of that field. This implies earlier NP -hardness results by Håstad (J. Algorithm. 11 (4), 644–654 1990 ). The hardness proof also implies an algebraic universality result.
更多查看译文
关键词
Computational complexity,Existential theory of fields,Tensor rank
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络