Anonymous

Changes

From dankwiki
221 bytes added, 03:29, 5 August 2009
|-
| Algorithmic design techniques (e.g. greedy, dynamic programming, divide and conquer)
|[http://academicearth.org/lectures/dynamic-programming-leiserson Dynamic Programming lecture] from MIT's [http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/CourseHome/index.htm 6.046J]
|-
| Upper and lower bounds on the complexity of specific problems