Pages that link to "Item:Q5419122"
From MaRDI portal
The following pages link to Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes (Q5419122):
Displaying 15 items.
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
- Sylvester-Gallai for arrangements of subspaces (Q728498) (← links)
- An ensemble of high rank matrices arising from tournaments (Q2104983) (← links)
- Sets of unit vectors with small subset sums (Q2796088) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY (Q2879416) (← links)
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (Q2879417) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- (Q5002633) (← links)
- (Q5090396) (← links)
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
- Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
- A Sylvester-Gallai-type theorem for complex-representable matroids (Q6662774) (← links)
