Quantum query complexity of minor-closed graph properties.
Andrew M. ChildsRobin KothariPublished in: STACS (2011)
Keyphrases
- query complexity
- graph properties
- graph theoretic
- data complexity
- graph theory
- directed graph
- membership queries
- maximal cliques
- exact learning
- expressive power
- dnf formulas
- concept class
- learning algorithm
- query answering
- vc dimension
- graph data
- microarray
- np complete
- upper bound
- query language
- relational databases
- databases