On the Complexity of Finding Tensor Ranks  

作　　者：Mohsen Aliabadi Shmuel Friedland 

机构地区：[1]Department of Mathematics,Iowa State University,411 Morrill Road,Ames,IA 50011-2104,USA [2]Department of Mathematics,Statistics and Computer Science,University of Illinois at Chicago,Chicago,IL 60607-7045,USA

出　　处：《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 arithmetic complexity of our algorithm.

关 键 词：Gauss elimination Homogeneous polynomial NP-HARDNESS Symmetric tensor Tensor rank 

分 类 号：O15[理学—数学]