On polynomially many queries to NP or QMA oracles.
Sevag GharibianDorian RudolphPublished in: CoRR (2021)
Keyphrases
- np complete
- query language
- query processing
- statistical queries
- web search engines
- database
- query evaluation
- dnf formulas
- efficient processing
- active learning
- database queries
- response time
- retrieval systems
- range queries
- user queries
- query logs
- upper bound
- query formulation
- computational complexity
- data model
- answering queries
- search engine