Pages that link to "Item:Q2920137"
From MaRDI portal
The following pages link to Using elimination theory to construct rigid matrices (Q2920137):
Displaying 8 items.
- Complexity of linear circuits and geometry (Q300885) (← links)
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- On the rigidity of Vandermonde matrices (Q1566747) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- On the geometry of tensor network states of \(2\times N\) grids (Q2419070) (← links)
- Computation of rigidity of order \(n^ 2/r\) for one simple matrix (Q3990226) (← links)
- Matrix Rigidity from the Viewpoint of Parameterized Complexity (Q4638994) (← links)