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 19 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)
- On lower bounds on the size of designs in compact symmetric spaces of rank 1 (Q1359065) (← links)
- An ensemble of high rank matrices arising from tournaments (Q2104983) (← links)
- Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound (Q2489925) (← 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)
- Rank bounds for design matrices with block entries and geometric applications (Q4645030) (← 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)
- On the p-rank of the design matrix of a difference set (Q5556466) (← links)
- A Sylvester-Gallai-type theorem for complex-representable matroids (Q6662774) (← links)
