More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP.
Lars EngebretsenJonas HolmerinPublished in: STACS (2005)
Keyphrases
- data streams
- computational complexity
- np hard
- np complete
- database
- query language
- response time
- constraint satisfaction problems
- random instances
- data retrieval
- query evaluation
- web search engines
- query processing
- range queries
- relevance feedback
- approximation algorithms
- learning theory
- decomposition methods
- information retrieval