关于这个播客 🔗

更新频率:
daily
平均音频长度:
46 minutes
英语
美国
60 集
自从 2010年9月23日
episodic

最新一集 🔗

Lecture 28: Gusfield recaps NP-completeness. The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.

搜索以前的节目

搜索Algorithm Design and Analysis以前的节目。

以前的节目

Lecture 28: Gusfield recaps NP-completeness. The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.
Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
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).
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 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 24 gives an introduction to P and NP and polynomial-time reductions.
免责声明: 本页面嵌入的播客和封面图片来自 Dan Gusfield,归其所有者所有,与 Listen Notes, Inc. 无关联,也未获得 Listen Notes, Inc. 背书。