A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.
Omar AlrabiahVenkatesan GuruswamiPravesh K. KothariPeter ManoharPublished in: STOC (2023)
Keyphrases
- lower bound
- upper bound
- query processing
- database
- query evaluation
- branch and bound algorithm
- user queries
- constraint satisfaction problems
- random instances
- response time
- relevance feedback
- keywords
- lower and upper bounds
- objective function
- constraint programming
- data structure
- query expansion
- np hard
- similarity search
- search space
- cost effective
- branch and bound
- theorem prover
- worst case
- constraint satisfaction
- range queries
- optimal solution
- theorem proving
- arc consistency
- decomposition methods
- data sources