Tight lower bounds for 2-query LCCs over finite fields.
Arnab BhattacharyyaZeev DvirShubhangi SarafAmir ShpilkaPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- lower bound
- upper bound
- database
- worst case
- branch and bound algorithm
- response time
- optimal solution
- query processing
- branch and bound
- objective function
- np hard
- database queries
- query formulation
- lower and upper bounds
- lower bounding
- finite number
- data structure
- computer vision
- retrieval systems
- relevance feedback
- query terms
- active learning
- vc dimension
- web search
- vector space
- user queries
- data sources
- databases