On polynomially many queries to NP or QMA oracles.
Sevag GharibianDorian RudolphPublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- np complete
- dnf formulas
- statistical queries
- query language
- query processing
- efficient processing
- response time
- database
- computational complexity
- query evaluation
- user queries
- web search engines
- aggregate queries
- np hard
- complex queries
- range queries
- concept class
- database queries
- query logs
- retrieval systems
- data sources
- databases
- uniform distribution
- query formulation
- pac learning
- attribute values
- answering queries
- active learning