关于这一集
Lecture 20 deals with unique-decipherability: efficient graph-based algorithm and proof of correctness.
英语
美国
在这一集里
文字稿 🔗
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.
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
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.
免责声明: 本页面嵌入的播客和封面图片来自 Dan Gusfield，归其所有者所有，与 Listen Notes, Inc. 无关联，也未获得 Listen Notes, Inc. 背书。
