Query (complexity)

Article summary

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

Key claims

No claims recorded.

Discussion questions

1. Summarise the article in your own words. Which single claim would you verify first, and why?
2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.