Новые эпизоды этого подкаста могут больше не появляться, некоторые аудиозаписи могут быть неисправными.
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по людям, местам или темам.
If I have seen further than others, it is by listening to podcasts and standing upon the shoulders of
giants.
‐ Isaac "Llamacorn" Newton
ПОИСК ПРОШЛЫХ ЭПИЗОДОВ
Искать прошлые эпизоды 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
ИЗМЕНИТЬ
Спасибо, что помогаете поддерживать базу подкастов актуальной.
