TENTANG EPISODE INI
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.
Inggris
Amerika Serikat
TRANSKRIP 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
CARI EPISODE TERDAHULU
Cari episode sebelumnya dari Algorithm Design and Analysis.
EPISODE LAIN DALAM PODCAST INI
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
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.
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.
Sanggahan: Podcast dan karya seni yang disematkan pada halaman ini berasal dari Dan Gusfield, yang merupakan milik pemiliknya dan tidak berafiliasi atau didukung oleh Listen Notes, Inc.
Sunting
Terima kasih telah membantu agar basis data podcast tetap terbaru
