Multiple-Size Divide-and-Conquer Recurrences
<|reference_start|>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.<|reference_end|>
@article{kao2001multiple-size,
    title={Multiple-Size Divide-and-Conquer Recurrences},
    author={Ming-Yang Kao},
    journal={SIGACT News, 28(2):67--69, June 1997},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0101011},
    primaryClass={cs.GL cs.DS}
}