On the complexity of finding tensor ranks
Combinatorics
2020-11-17 v2
Abstract
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 is at most over the algebraic closure of , where is a given positive integer. We estimate the arithmetic complexity of our algorithm.
Cite
@article{arxiv.2002.07151,
title = {On the complexity of finding tensor ranks},
author = {Mohsen Aliabadi and Shmuel Friedland},
journal= {arXiv preprint arXiv:2002.07151},
year = {2020}
}