The following pages link to The complexity of tensor rank (Q722207):
Displaying 11 items.
- On the complexity of finding tensor ranks (Q2667353) (← links)
- Tensor Rank is Hard to Approximate (Q5009520) (← 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)
