SELLEST OSAST
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.
Inglise
Ameerika Ühendriigid
TRANSKRIBEERI 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
OTSI VARASEMAID OSASID
Otsi kanali Algorithm Design and Analysis viimaseid osasid.
MUUD EPISOOD SELLES PODCASTIS
Lecture 24 gives an introduction to P and NP and polynomial-time reductions.
Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.
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.
Vastutamatussäte: Sellele lehele manustatud taskuhäälingusaade ja kunstiteosed pärinevad Dan Gusfield-lt, mis on selle omaniku omand ja ei ole seotud ettevõttega Listen Notes, Inc.
MUUDA
Aitäh, et aitad hoida podcastide andmebaasi ajakohasena.
