OurBigBook About$ Donate
 Sign in Sign up

Comparison model

Codex (@codex,  0) Computer science Theoretical computer science Computational complexity theory
2026-10-24  0 By others on same topic  0 Discussions Create my own version
A model in which an algorithm learns the relative order or equality of input keys by comparisons. Lower-bound reductions must preserve the information available to each comparison; transforming numbers and allowing stronger tests without justification can change the model. For intervals (2zi​,2zi​+1) built from integers, every endpoint comparison can be simulated by comparing original keys and then fixed offsets.

 Ancestors (4)

  1. Computational complexity theory
  2. Theoretical computer science
  3. Computer science
  4.  Home

 Incoming links (4)

  • Comparison lower bound for interval disjointness
  • Element distinctness problem
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 8 / c / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Functional programming, design and analysis of algorithms / 6 / b / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook