אודות פרק זה
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.
אנגלית
ארצות הברית
תעתיק 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
פרקים אחרים בפודקאסט הזה
Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.
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 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
הצהרה: הפודקאסט והגרפיקה המוטבעים בדף זה הם מ-Dan Gusfield, שהוא רכושו של בעליו ואינו קשור או מאושר על ידי Listen Notes, Inc.
