The following pages link to (Q5002633):
Displaying 5 items.
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← 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)
- Lower bounds for constant query affine-invariant LCCs and LTCs (Q5368746) (← links)