Jump to content

Query complexity

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Onel5969 (talk | contribs) at 10:59, 13 December 2023 (as per dab, one bluelink per entry). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Query complexity can refer to one of the following notions in computer science:

  • Query complexity in database theory, the complexity of evaluating a query on a database when measured as a function of the query size
  • Query complexity, the complexity of a computational problem in the decision tree model.