ABOUT THIS EPISODE
Lecture 28: Gusfield recaps NP-completeness.
The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.
The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.
English
United States
TRANSCRIPT 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
SEARCH PAST EPISODES
Search past episodes of Algorithm Design and Analysis.
OTHER EPISODES IN THIS PODCAST
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
Lecture 24 gives an introduction to P and NP and polynomial-time reductions.
Lecture 25 deals with an intuitive view of NP - not the correct formal definition.
Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.
Disclaimer: The podcast and artwork embedded on this page are from Dan Gusfield, which is the property of its owner and not affiliated with or endorsed by Listen Notes, Inc.
EDIT
Thank you for helping to keep the podcast database up to date.
