Multiple-Size Divide-and-Conquer Recurrences
Ming-Yang Kao
Abstract
This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n2.
Create a lesson
Related papers
The Reconstructions of Konrad Zuse's Z3 Computer
Raul Rojas
Symbolic Mathematical Computation 1965--1975: The emergence of a discipline
Robert M. Corless, Arthur C. Norman, Tomas Recio et al.
A Brief History of Fr\'echet Distances: From Curves and Probability Laws to FID
Yuli Wu
The Theorems of Dr. David Blackwell and Their Contributions to Artificial Intelligence
Napoleon Paxton
POSIM: A Multi-Agent Simulation Framework for Social Media Public Opinion Evolution and Governance
Yongmao Zhang, Kai Qiao, Zhengyan Wang et al.
Jean-Raymond Abrial: A Scientific Biography of a Formal Methods Pioneer
Jonathan P. Bowen, Henri Habrias