The following pages link to The complexity of tensor rank (Q722207):
Displaying 23 items.
- Typical tensorial rank (Q1064383) (← links)
- The complexity of tensor circuit evaluation (Q2472427) (← links)
- On the complexity of finding tensor ranks (Q2667353) (← links)
- Tensor rank is NP-complete (Q3203928) (← links)
- Length Complexity of Tensor Products (Q3578225) (← links)
- Tensor codes for the rank metric (Q4336395) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- On the tensor rank of $3\times 3$ permanent and determinant (Q5003343) (← links)
- Tensor Rank is Hard to Approximate (Q5009520) (← links)
- (Q5011283) (← links)
- (Q5092486) (← links)
- Hankel Tensor Decompositions and Ranks (Q5380271) (← links)
- Most Tensor Problems Are NP-Hard (Q5395740) (← links)
- On the average condition number of tensor rank decompositions (Q5857334) (← links)
- Topological art in simple galleries (Q6204773) (← links)
- The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
- Monomial isomorphism for tensors and applications to code equivalence problems (Q6564091) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- Rank of a tensor and quantum entanglement (Q6593278) (← links)
- Non-interactive commitment from non-transitive group actions (Q6595925) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)
- Several remarks on tensor rank computation (Q6671381) (← links)
