Maximal Rank of $m\times n\times(mn-k)$ Tensors

DOI10.1137/0219031zbMath0698.68039OpenAlexW101436286MaRDI QIDQ3476270

Nader H. Bshouty

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0219031

zbMATH Keywords

computational complexitytensor rankbilinear

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (3)

Multiplicative complexity of direct sums of quadratic systems ⋮ Maximal Rank of ${m}\times{n}\times 2$ Tensors over Arbitrary Fields ⋮ Monotonically convergent algorithms for symmetric tensor approximation

This page was built for publication: Maximal Rank of $m\times n\times(mn-k)$ Tensors