Pages that link to "Item:Q2667353"
From MaRDI portal
The following pages link to On the complexity of finding tensor ranks (Q2667353):
Displaying 10 items.
- The complexity of tensor rank (Q722207) (← links)
- Tensor rank is NP-complete (Q3203928) (← links)
- On Tensor-Train Ranks of Tensorized Polynomials (Q3297707) (← links)
- Lower bounds for polar and tensor ranks (Q3767454) (← links)
- (Q5011283) (← links)
- Polynomial bound for the partition rank vs the analytic rank of tensors (Q5126770) (← links)
- On the average condition number of tensor rank decompositions (Q5857334) (← links)
- On semidefinite programming characterizations of the numerical radius and its dual norm (Q6592215) (← links)
- Rank of a tensor and quantum entanglement (Q6593278) (← links)
- Several remarks on tensor rank computation (Q6671381) (← links)