Multiple-Size Divide-and-Conquer Recurrences
综合文献
2007-05-23 v1 数据结构与算法
摘要
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) + n^2.
引用
@article{arxiv.cs/0101011,
title = {Multiple-Size Divide-and-Conquer Recurrences},
author = {Ming-Yang Kao},
journal= {arXiv preprint arXiv:cs/0101011},
year = {2007}
}