Is this your podcast?
Sign up to track ranks and reviews from iTunes, Stitcher and more
Algorithm Design and Analysis
The purpose of this undergraduate course is to introduce fundamental techniques and viewpoints for the design and the analysis of efficient computer algorithms, and to study important specific algorithms. The course relies heavily on mathematics and mathematical thinking in two ways: first as a way of proving properties about particular algorithms such as termination, and correctness; and second, as a way of establishing bounds on the worst case (or average case) use of some resource, usually time, by a specific algorithm. The course covers some randomized algorithms as well as...
Listen now
Ratings & Reviews
4.1 stars from 10 ratings
Recent Episodes
Lecture 28: Gusfield recaps NP-completeness. The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.
Published 12/03/10
Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
Published 12/01/10
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
Published 11/29/10
Do you host a podcast?
Track your ranks and reviews from iTunes, Stitcher and more.
See hourly chart positions and more than 30 days of history.
Get Chartable Analytics »