Tight lower bounds for linear 2-query LCCs over finite fields.
Arnab BhattacharyyaZeev DvirShubhangi SarafAmir ShpilkaPublished in: Comb. (2016)
Keyphrases
- lower bound
- upper bound
- database
- query processing
- branch and bound algorithm
- branch and bound
- np hard
- response time
- query formulation
- lower and upper bounds
- database queries
- query evaluation
- user queries
- data structure
- objective function
- worst case
- data sources
- vector space
- range queries
- optimal solution
- quadratic assignment problem
- retrieval method
- statistical queries
- finite dimensional
- regret bounds
- sample complexity
- complex queries
- relevance feedback
- database systems
- computer vision
- databases