Ce podcast peut ne plus sortir de nouveaux épisodes, et certains fichiers audio peuvent être endommagés.
Maybe this podcast has a new rss feed?
À PROPOS DE CE PODCAST 🔗
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.
Fréquence de mise à jour:
daily
Durée audio moyenne:
46 minutes
Anglais
États-Unis
60 épisodes
depuis 23 septembre 2010
episodic
DERNIER ÉPISODE 🔗
Lecture 28: Gusfield recaps NP-completeness.
The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.
RECHERCHER LES ÉPISODES PASSÉS
Rechercher les épisodes précédents de Algorithm Design and Analysis.
ÉPISODES PRÉCÉDENTS 🔗
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.
Avertissement: Le podcast et les illustrations intégrés sur cette page proviennent de Dan Gusfield, qui est la propriété de son propriétaire et n'est ni affilié ni approuvé par Listen Notes, Inc.
MOTEUR DE RECHERCHE DE PODCASTS
Vous pouvez utiliser notre site Web pour rechercher des podcasts3,822,195et des épisodes195,457,892par personnes, lieux ou sujets.
Investir dans le savoir offre le meilleur rendement, c'est pourquoi j'écoute des podcasts.
‐ Benjamin "Llamacorn" Franklin
RECHERCHER LES ÉPISODES PASSÉS
Rechercher les épisodes précédents de Algorithm Design and Analysis.
DEMANDER CE PODCAST
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 petites annonces 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
interview de podcasteur...
✓
If you share your Listen Notes page and at-mention @ListenNotes
on X (formerly Twitter),
notre compte officiel sur X (anciennement 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
MODIFIER
Merci de nous avoir aidé à tenir la base de données de podcasts à jour.
