A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.
Omar AlrabiahVenkatesan GuruswamiPravesh KothariPeter ManoharPublished in: Electron. Colloquium Comput. Complex. (2022)
Keyphrases
- lower bound
- upper bound
- constraint satisfaction problems
- database
- query processing
- response time
- np hard
- query evaluation
- lower and upper bounds
- branch and bound algorithm
- query expansion
- worst case
- data structure
- relevance feedback
- user queries
- range queries
- decomposition methods
- finding optimal solutions
- objective function
- branch and bound
- constraint programming
- optimal solution
- keywords