A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.
Omar AlrabiahVenkatesan GuruswamiPravesh K. KothariPeter ManoharPublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- constraint satisfaction problems
- query evaluation
- query processing
- data structure
- relevance feedback
- response time
- np hard
- optimal solution
- branch and bound
- user queries
- database
- constraint satisfaction
- objective function
- locally decodable codes
- branch and bound algorithm
- range queries
- query expansion
- low cost
- theorem proving
- inductive inference
- cryptographic protocols
- finding optimal solutions
- worst case