Related papers: The Complexity of Tensor Rank
The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…
We revisit Schmidt's theorem connecting the Schmidt rank of a tensor with the codimension of a certain variety and adapt the proof to the case of arbitrary characteristic. We also find a sharper result of this kind for homogeneous…
We introduce subspace rank as a tool for studying ranks of tensors and X-rank more generally. We derive a new upper bound for the rank of a tensor and determine the ranks of partially symmetric tensors in C^2 \otimes C^b \otimes C^b. We…
This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…
An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…
This study clarifies the proper criteria to assess the modeling capacity of a general tensor model. The work analyze the problem based on the study of tensor ranks, which is not a well-defined quantity for higher order tensors. To process,…
The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP question and the "Deterministic" versus "Non Deterministic"…
For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…
We introduce the $G$-stable rank of a higher order tensors over perfect fields. The $G$-stable rank is related to the Hilbert-Mumford criterion for stability in Geometric Invariant Theory. We will relate the $G$-stable rank to the tensor…
In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems. We show in an explicit form that this…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known…
In this paper, we present a partial survey of the tools borrowed from tensor algebra, which have been utilized recently in Statistics and Signal Processing. It is shown why the decompositions well known in linear algebra can hardly be…
We survey recent developments in the study of probabilistic complexity classes. While the evidence seems to support the conjecture that probabilism can be deterministically simulated with relatively low overhead, i.e., that $P=BPP$, it also…
Tensor fields depending on other tensor fields are considered. The concept of extended tensor fields is introduced and the theory of differentiation for such fields is developed.
In this paper, we study several definitions of generalized rank weights for arbitrary finite extensions of fields. We prove that all these definitions coincide, generalizing known results for extensions of finite fields.
We report about the state of the art on complex and real generic identifiability of tensors, we describe some of our recent results obtained in [6] and we present perspectives on the subject.
Constant rank theorems are obtained for saddle solutions to the special Lagrangian equation and the quadratic Hessian equation. The argument also leads to Liouville type results for the special Lagrangian equation with subcritical phase,…