關於這一集
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
本 Podcast 中的其他單集
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 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.
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
免責聲明: 本頁面嵌入的 Podcast 和封面圖片來自 Dan Gusfield，歸其所有者所有，與 Listen Notes, Inc. 無關聯，也未獲得 Listen Notes, Inc. 背書。
