Pages that link to "Item:Q2875193"
From MaRDI portal
The following pages link to Tensor-rank and lower bounds for arithmetic formulas (Q2875193):
Displaying 10 items.
- A spectral theory for tensors (Q661140) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
- The Computational Power of Depth Five Arithmetic Circuits (Q4629389) (← links)
- Border Rank Nonadditivity for Higher Order Tensors (Q4986826) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- Tensor Rank is Hard to Approximate (Q5009520) (← links)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
