Charts
Algorithm Design and AnalysisEpisode from the podcastAlgorithm Design and Analysis
Next Episode
Major theorems of NP-completeness

Major theorems of NP-completeness

Released Wednesday, 1st December 2010
Good episode? Give it some love!
Major theorems of NP-completeness

Major theorems of NP-completeness

Major theorems of NP-completeness

Major theorems of NP-completeness

Wednesday, 1st December 2010
Good episode? Give it some love!
Rate Episode
List
About
InsightsPodchaser Pro
Reviews
Credits
Lists
Transcript

Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.

Show More
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 Logo

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