OM DENNE EPISODE
Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
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ØG BLANDT TIDLIGERE EPISODER
Søg efter gamle afsnit af Algorithm Design and Analysis.
ANDRE EPISODE I DENNE PODCAST
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 24 gives an introduction to P and NP and polynomial-time reductions.
Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.
Ansvarsfraskrivelse: Podcasten og kunstværket, der er indlejret på denne side, er fra Dan Gusfield, som tilhører dens ejer og ikke er tilknyttet eller godkendt af Listen Notes, Inc.
REDIG
Tak fordi du hjælper med at holde podcast-databasen opdateret.
