Chevron Left
Zurück zu Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Kursteilnehmer-Bewertung und -Feedback für Shortest Paths Revisited, NP-Complete Problems and What To Do About Them von Stanford University

4.8
Sterne
740 Bewertungen
102 Bewertungen

Über den Kurs

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)....

Top-Bewertungen

AA
27. Feb. 2017

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
22. Aug. 2018

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.\n\nOne of the best courses I did on Coursera.

Filtern nach:

101 - 101 von 101 Bewertungen für Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

von Xiao Z

17. Aug. 2019

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