이 팟캐스트 소개 🔗

업데이트 빈도:
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).

An intuitive view of NP

Lecture 25 deals with an intuitive view of NP - not the correct formal definition.

An intuitive view of NP

Lecture 25 deals with an intuitive view of NP - not the correct formal definition.

Introduction to P and NP

Lecture 24 gives an introduction to P and NP and polynomial-time reductions.

Introduction to P and NP

Lecture 24 gives an introduction to P and NP and polynomial-time reductions.
면책 조항: 이 페이지에 포함된 팟캐스트와 작품은 Dan Gusfield에서 가져온 것입니다. 이 팟캐스트는 소유자의 재산이며 Listen Notes, Inc.와 제휴하거나 보증하지 않습니다.