OM DENNE EPISODE
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.
Engelsk
USA
UDSKRIFT 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
SØK BLANT TIDLIGERE EPISODER
Søk etter gamle episoder av Algorithm Design and Analysis.
ANDRE EPISODE I DENNE PODKAST
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 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 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
Ansvarsfraskrivelse: Podkasten og kunstværket, det finnes indlejret på denne siden, er fra Dan Gusfield, som tilhører dens eier og ikke er tilknyttet eller godkjent av Listen Notes, Inc.
REDIG
Takk fordi du hjelper med å holde podkast-databasen oppdatert.
