A Master Theorem for Discrete Divide and Conquer Recurrences

Divide-and-conquer recurrences are one of the most studied equations in computer science. Yet, discrete versions of these recurrences, namely for some known sequence a n and given b j , b j , p j and δ j , δ j , present some challenges. The discrete nature of this recurrence (represented by the floo...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of the ACM 2013-06, Vol.60 (3), p.1-49
Hauptverfasser:	DRMOTA, Michael, SZPANKOWSKI, Wojciech
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithmics. Computability. Computer arithmetics Applied sciences Coding, codes Computer science Computer science control theory systems Dirichlet problem Divide & conquer algorithms Exact sciences and technology Information, signal and communications theory Mathematical analysis Mathematical functions Mathematics Number theory Sciences and techniques of general use Sequences, series, summability Signal and communications theory Studies Telecommunications and information theory Theorems Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!