Episode from the podcastAlgorithm Design and Analysis

Coping with NP-completeness

Released Friday, 3rd December 2010

Good episode? Give it some love!

Coping with NP-completeness

Friday, 3rd December 2010

Good episode? Give it some love!

Rate Episode

List

Lecture 28: Gusfield recaps NP-completeness.The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.

Rate

List

Get this podcast via API

From The Podcast

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 deterministic algorithms.

Join Podchaser to...

Rate podcasts and episodes
Follow podcasts and creators
Create podcast and episode lists
& much more

Do you host or manage this podcast?
Claim and edit this page to your liking.

Podchaser is the ultimate destination for podcast data, search, and discovery. Learn More