Multiple-Size Divide-and-Conquer Recurrences

Simple item page
dc.creatorKao, Ming-Yang
dc.date2001-01-15
dc.date.accessioned2026-07-07T03:16:51Z
dc.date.available2026-07-07T03:16:51Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/cs/0101011
dc.identifierhttp://arxiv.org/abs/cs/0101011
dc.identifierSIGACT News, 28(2):67--69, June 1997
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30507
dc.subjectGeneral Literature
dc.subjectData Structures and Algorithms
dc.subjectF.2
dc.titleMultiple-Size Divide-and-Conquer Recurrences
dc.typetext

Files

Collections

arXiv