Pages that link to "Item:Q1280658"
From MaRDI portal
The following pages link to Improved lower bounds on the rigidity of Hadamard matrices (Q1280658):
Displaying 13 items.
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- Complexity of linear circuits and geometry (Q300885) (← links)
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- More on average case vs approximation complexity (Q430823) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes (Q817830) (← links)
- On rigid matrices and \(U\)-polynomials (Q901935) (← links)
- Shadows and intersections: Stability and new proofs (Q932174) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- On the rigidity of Vandermonde matrices (Q1566747) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- Matrix rigidity (Q1970501) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
