این پادکست ممکن است دیگر قسمت های جدیدی را منتشر نکند ، و ممکن است برخی از فایلهای صوتی خراب شوند.
Maybe this podcast has a new rss feed?
درباره این پادکست 🔗
The purpose of this undergraduate course is to introduce fundamental techniques and viewpoints for the design and the analysis of efficient computer algorithms, and to study important specific algorithms. The course relies heavily on mathematics and mathematical thinking in two ways: first as a way of proving properties about particular algorithms such as termination, and correctness; and second, as a way of establishing bounds on the worst case (or average case) use of some resource, usually time, by a specific algorithm. The course covers some randomized algorithms as well as deterministic algorithms.
فرکانس به روز رسانی:
daily
میانگین طول صدا:
46 minutes
انگلیسی
ایالات متحده آمریکا
60 قسمت
از سال 23 سپتامبر 2010
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 وابسته یا تایید نشده است.
موتور جستجوی پادکست
می توانید از وب سایت ما برای جستجوی پادکست های3,822,188و قسمت های195,453,017بر اساس افراد، مکان ها یا موضوعات استفاده کنید.
I have no special talent. I am only passionately curious, and
I listen to podcasts.
‐ Albert "Llamacorn" Einstein
جستجوی اپیزودهای گذشته
اپیزودهای قبلی Algorithm Design and Analysis را جستجو کن.
مدعی این پادکست شوید
Why to claim podcasts?
If you are a podcaster, the best way to manage your podcasts on Listen Notes is by claiming your Listen Notes
podcast pages.
It is a great, free way to engage the podcast community and increase the visibility of your podcasts.
After claiming your Listen Notes podcast pages, you will be able to:
✓
Manually refresh the RSS feed to sync up
✓
Get a verified badge (
✓
) alongside with your podcast name on Listen Notes
✓
Post آگهی‌های طبقه‌بندی‌شده for sponsorship,
guests, co-hosts,
cross-promotion...
✓
Respond to listener comments on Listen Notes
✓
Use speech-to-text techniques to transcribe your show and
edit transcripts
✓
Improve the presence of your podcasts, e.g., self-service
مصاحبه با پادکستر...
✓
If you share your Listen Notes page and at-mention @ListenNotes
on X (formerly Twitter),
حساب رسمی X ما (که قبلاً Twitter بود) will retweet to promote
your show to our followers.
Coming soon:
◯ Self-service promotion on Listen Notes
◯ Track your podcast stats on Listen
Notes, e.g., listens, page
views...
◯ Manage episodes
ویرایش
از کمک شما برای بروز نگهداشتن پایگاهدادههای پادکست سپاسگزاریم
