Multiple-Size Divide-and-Conquer Recurrences

Computer Science – General Literature

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-531353

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.