Multiple-Size Divide-and-Conquer Recurrences

Details Multiple-Size Divide-and-Conquer Recurrences Multiple-Size Divide-and-Conquer Recurrences

2001-01-15

arxiv.org/abs/cs/0101011v1

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

Computer Science

General Literature

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Multiple-Size Divide-and-Conquer Recurrences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiple-Size Divide-and-Conquer Recurrences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple-Size Divide-and-Conquer Recurrences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-531353