Pages that link to "Item:Q3397730"
From MaRDI portal
The following pages link to Complexity Lower Bounds using Linear Algebra (Q3397730):
Displaying 23 items.
- Complexity of linear circuits and geometry (Q300885) (← links)
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← links)
- On a theorem of Razborov (Q445247) (← links)
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- A linear algebraic view of partition regular matrices (Q603111) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- On rigid matrices and \(U\)-polynomials (Q901935) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- A new lower bound for the positive semidefinite minimum rank of a graph (Q1931723) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Matrix and tensor rigidity and \(L_p\)-approximation (Q2145080) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Kolmogorov width and approximate rank (Q2423217) (← links)
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (Q2879417) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Fourier and circulant matrices are not rigid (Q5091768) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- Fourier and Circulant Matrices are Not Rigid (Q5857612) (← links)
- Arithmetic circuits, structured matrices and (not so) deep learning (Q6109070) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
