Encyclopedia
Query complexity
Index of articles associated with the same name
Query complexity in computational complexity describes the number of queries needed to solve a computational problem for an input that can be accessed only through queries. See in particular:
- Aanderaa-Karp-Rosenberg conjecture, on the query complexity of graph problems accessed by querying the existence of edges
- Property testing, the study of query complexity for distinguishing objects having a property from objects far from having it
- Probabilistically checkable proof, a proof that can be verified by making a small number of queries to the bits of the proof
- Quantum complexity theory#Quantum query complexity, the number of queries needed to solve a problem using a quantum algorithm
- Query complexity in the decision tree model, the number of queries needed to solve a computational problem by an algorithm that is restricted to take the form of a decision tree
- Decision tree model#Quantum decision tree, decision tree complexity for a quantum decision tree
- Equitable cake-cutting#Query complexity, the number of times one must query participant preferences in a fair sharing procedure
Sources and credits
This article is adapted from the Wikipedia article “Query complexity”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.