Chevron Left
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them に戻る

スタンフォード大学(Stanford University) による Shortest Paths Revisited, NP-Complete Problems and What To Do About Them の受講者のレビューおよびフィードバック

4.8
764件の評価

コースについて

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search)....

人気のレビュー

AA

2017年2月27日

This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.

AS

2018年8月22日

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.

One of the best courses I did on Coursera.

フィルター:

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them: 101 - 103 / 103 レビュー

by Thành N K

2019年9月15日

so hard

by --

2021年4月27日

Sometimes is really hard to understand, I wish more examples and visualization rather than straightforward speech.

by Xiao Z

2019年8月17日

Can be expanded more. Some of the quizzes are too hard.