قد لا يصدر هذا التدوين الصوتي حلقات جديدة بعد الآن، وقد يتم تعطيل بعض الأصوات.
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 أو معتمدة منها.
محرك بحث البودكاست
يمكنك استخدام موقعنا الإلكتروني للبحث في ملفات podcast3,822,195وحلقات195,457,892حسب الأشخاص أو الأماكن أو المواضيع.
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
تعديل
شكراً على مساعدتنا في الحفاظ على قاعدة بيانات البودكاست مُحدَّثة.
