[FrontPage] [TitleIndex] [WordIndex

Note: You are looking at a static copy of the former PineWiki site, used for class notes by James Aspnes from 2003 to 2012. Many mathematical formulas are broken, and there are likely to be other bugs as well. These will most likely not be fixed. You may be able to find more up-to-date versions of some of these notes at http://www.cs.yale.edu/homes/aspnes/#classes.

Today we'll do what LevitinBook calls DecreaseByConstantFactor and DecreaseByVariableFactor algorithms. These are algorithms whose recurrence is of the form


where k may depend on any number of things.

1. Examples

Egyptian fractions were discussed at some length for no good reason. If you want to find out more about them, there is no more comprehensive resource that David Eppstein's Egyptian fractions web page. You do not need to know about these for the course.

2014-06-17 11:58