Pages that link to "Item:Q2947559"
From MaRDI portal
The following pages link to Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length (Q2947559):
Displaying 6 items.
- Smooth and strong PCPs (Q2029773) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- Three query locally decodable codes with higher correctness require exponential length (Q3113729) (← links)
- Towards 3-query locally decodable codes of subexponential length (Q3546358) (← links)
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits (Q5422493) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)