Zurück zu Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Bewertung und Feedback des Lernenden für Shortest Paths Revisited, NP-Complete Problems and What To Do About Them von Stanford University
762 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 - 103 von 103 Bewertungen für Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
von Thành N K
•15. Sep. 2019
so hard
von --
•27. Apr. 2021
Sometimes is really hard to understand, I wish more examples and visualization rather than straightforward speech.
von Xiao Z
•17. Aug. 2019
Can be expanded more. Some of the quizzes are too hard.
Coursera Footer
© 2022 Coursera Inc. Alle Rechte vorbehalten.
