论文信息 - Multiple-size divide-and-conquer recurrences

Multiple-size divide-and-conquer recurrences

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.

Ming-Yang Kao

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] J. Saxe,et al. A general method for solving divide-and-conquer recurrences , 1980, SIGA.

[3] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .

[4] George S. Lueker,et al. Some Techniques for Solving Recurrences , 1980, CSUR.

[5] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..