Master theorem

Known as: Master Method, Master's Theorem, Mastor theorem

In the analysis of algorithms, the master theorem provides a solution in asymptotic terms (using Big O notation) for recurrence relations of types…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

The theory of algorithms complexity is of great importance in both theoretical and applied computer science. One of its main…

2012

This paper presents CAN-based parallel-operation and load-sharing techniques for the communication server power supply. With the…

2012

This paper presents CAN-based parallel-operation and load-sharing techniques for the communication server power supply. With the…

2011

The master theorem provides a solution to a well-known divide-and-conquer recurrence, called here the master recurrence. This…

2007

Stereo matching with regions is a master method for binocular image matching of wide baseline. It is most difficult that…

2005

2004

Rotating master-slave current programming method (RMSCPM) is known in theory for long time. Advantage of the rotating master…

1994

Abstract The complexity of divide-and-conquer algorithms is often described by recurrences of the form T(n) = aT(n/c) + f(n). In…

1983

1967

This paper is concerned with three main problems and their interrelationship. A function M(x) belongs to the "moment-class" M* if…