Construct · 1 fields · 1 citations

master theorem: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
mastertheorem1 CONSTRUCTMaster theoremBENTLEY · ANALYSIS OF

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

Analysis of algorithms

a general solution giving asymptotic bounds for divide-and-conquer recurrences by comparing the work at the root with the work at the leaves.

In analysis of algorithms, master theorem refers to a general solution giving asymptotic bounds for divide-and-conquer recurrences by comparing the work at the root with the work at the leaves. This meaning comes from Bentley (1980) in ACM SIGACT News.[1]

Unit
Recovery means
Measured by

Next

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

See how master theorem 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

master1 fields · 1 citationsanchor · a standalone constructroot3 fields · 5 citationsjingle · one word, three constructssolution3 fields · 4 citationsjingle · one word, three constructs

References

  1. Bentley, J. L., Haken, D., & Saxe, J. B. (1980). A general method for solving divide-and-conquer recurrences. ACM SIGACT News, 12(3), 36-44. https://doi.org/10.1145/1008861.1008865

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