The Complexity of Tensor Rank
Marcus Schaefer, Daniel Stefankovic

TL;DR
This paper establishes that determining tensor rank over a field is as computationally complex as solving the existential theory of that field, linking tensor problems to fundamental algebraic decision problems.
Contribution
It proves the computational hardness of tensor rank determination over any field, extending previous NP-hardness results and revealing algebraic universality.
Findings
Tensor rank decision problem is as hard as the existential theory of the field.
The hardness proof generalizes NP-hardness to all fields.
The results connect tensor problems with fundamental algebraic decision problems.
Abstract
We show that determining the rank of a tensor over a field has the same complexity as deciding the existential theory of that field. This implies earlier NP-hardness results by H{\aa}stad~\cite{H90}. The hardness proof also implies an algebraic universality result.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Parallel Computing and Optimization Techniques · Computability, Logic, AI Algorithms
