期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
On the Complexity of Finding Tensor Ranks
1
作者 Mohsen Aliabadi Shmuel Friedland 《Communications on Applied Mathematics and Computation》 2021年第2期281-289,共9页
The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field F is at most k over the algebraic closure of F,where K is a given positive integer.We estimate the ar... The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field F is at most k over the algebraic closure of F,where K is a given positive integer.We estimate the arithmetic complexity of our algorithm. 展开更多
关键词 gauss elimination Homogeneous polynomial NP-HARDNESS Symmetric tensor Tensor rank
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部