ACERCA DE ESTE EPISODIO
Lecture 24 gives an introduction to P and NP and polynomial-time reductions.
Inglés
Estados Unidos
TRANSCRIPCIÓN 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
BUSCAR EPISODIOS ANTERIORES
Buscar episodios anteriores de Algorithm Design and Analysis.
OTROS EPISODIOS EN ESTE PODCAST
Lecture 24 gives an introduction to P and NP and polynomial-time reductions.
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.
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.
Descargo de responsabilidad: El podcast y el arte incluidos en esta página son de Dan Gusfield, que es propiedad de su propietario y no está afiliado ni respaldado por Listen Notes, Inc.
EDITAR
Gracias por ayudar a mantener actualizada la base de datos de podcasts.
