이 에피소드에 관해
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.와 제휴하거나 보증하지 않습니다.
