このエピソードについて
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 24 gives an introduction to P and NP and polynomial-time reductions.
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.
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.
免責: このページに埋め込まれているポッドキャストとアートワークは Dan Gusfield からのものであり、その所有者の所有物であり、Listen Notes, Inc. と提携または承認されていません。
