An exact algorithm with O*(|F|^{(R-max_d n_d)(sum_d n_d)+max_d n_d}) time decides tensor rank over finite fields, with a border-rank variant over F[x]/(x^H).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Depth-first search for tensor rank and border rank over finite fields
An exact algorithm with O*(|F|^{(R-max_d n_d)(sum_d n_d)+max_d n_d}) time decides tensor rank over finite fields, with a border-rank variant over F[x]/(x^H).