Exponential lower bound for 2-query locally decodable codes via a quantum argument.
Iordanis KerenidisRonald de WolfPublished in: J. Comput. Syst. Sci. (2004)
Keyphrases
- lower bound
- upper bound
- database
- query processing
- response time
- query expansion
- branch and bound algorithm
- data sources
- user queries
- branch and bound
- query evaluation
- data structure
- worst case
- range queries
- database systems
- sufficiently accurate
- information retrieval systems
- np hard
- optimal solution
- lower and upper bounds
- xpath queries
- quantum computing
- locally decodable codes