More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP.
Lars EngebretsenJonas HolmerinPublished in: Random Struct. Algorithms (2008)
Keyphrases
- np complete
- np hard
- constraint satisfaction problems
- approximate answers
- user queries
- data retrieval
- query language
- query processing
- state space
- decomposition methods
- indexing structure
- search engine
- database queries
- approximation algorithms
- query evaluation
- computational complexity
- response time
- range queries
- database
- complex queries
- multi dimensional
- query formulation
- efficient computation
- efficient processing
- data model
- information retrieval