The following pages link to A remark on matrix rigidity (Q293150):
Displaying 18 items.
- 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)
- On a theorem of Razborov (Q445247) (← links)
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- On rigid matrices and \(U\)-polynomials (Q901935) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- Rigidity of a simple extended lower triangular matrix (Q963424) (← 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 of random Toeplitz matrices (Q1653338) (← links)
- Matrix rigidity (Q1970501) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Fourier and circulant matrices are not rigid (Q5091768) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
