Multiple-Size Divide-and-Conquer Recurrences

2001/01/15 by Ming-Yang Kao
Computer Science · #cs.GL #cs.DS

paper · pdf

published as SIGACT News, 28(2):67--69, June 1997

arxiv created 2001/01/15 · arxiv updated 2009/11/30

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) + n².

Related

• A Best Possible General Form of the Master Theorem for Divide-and-Conquer Recurrences
• On the growth of multi-recurrences
• Geometrical Interpretation of the Master Theorem for Divide-and-conquer Recurrences
• Quantitative growth of multi-recurrences
• Quantitative growth of multi-recurrence sequences