Pages that link to "Item:Q519967"
From MaRDI portal
The following pages link to Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967):
Displaying 7 items.
- Zero-free regions of partition functions with applications to algorithms and graph limits (Q1786055) (← links)
- A finitary structure theorem for vertex-transitive graphs of polynomial growth (Q2036622) (← links)
- Sylvester-Gallai type theorems for approximate collinearity (Q2879416) (← links)
- (Q5002633) (← links)
- A generalized Sylvester–Gallai-type theorem for quadratic polynomials (Q5058240) (← links)
- A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
- Lower bounds for constant query affine-invariant LCCs and LTCs (Q5368746) (← links)