Construct · 1 fields · 1 citations

query complexity: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
querycomplexity1 CONSTRUCTQuery complexityBUHRMAN · THEORY OF

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

the number of input bits or queries an algorithm must examine in the worst case to compute a function, studied as a measure of problem hardness.

In theory of computation, query complexity refers to the number of input bits or queries an algorithm must examine in the worst case to compute a function, studied as a measure of problem hardness. This meaning comes from Buhrman (2002) in Theoretical Computer Science.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how query complexity sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

case2 fields · 3 citationsjingle · one word, two constructscomplexity4 fields · 7 citationsjingle · one word, four constructsfunction5 fields · 6 citationsjingle · one word, five constructs

References

  1. Buhrman, H., & de Wolf, R. (2002). Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, 288(1), 21-43. https://doi.org/10.1016/s0304-3975(01)00144-x

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct