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
736 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:

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

von Samuel E

12. März 2020

That was awesome, thank you!

von Haixu L

24. Dez. 2020

Great class. Learned a lot!

von Thomas S

25. Jan. 2018

Nice Lessons, nice Grades!

von Tsogtbayar N

10. Sep. 2017

Thanks for the instructor.

von Anton B

18. Jan. 2019

Tim, thank you very much!

von Sui X

11. Juni 2019

wow, such an good course

von zhangdi

6. Dez. 2017

Stanford神课,占坑留名。4/4

von Yu G

6. Feb. 2021

Highly-recommended

von Jianghua F

29. Jan. 2018

Insightful course!

von Minyue D

13. Juli 2017

Awesone Course!!!!

von Ajit B

6. Sep. 2020

Terrific course!

von biswa

10. Nov. 2018

Great material!

von Dinghan X

5. Juni 2020

Great Course

von Madhurya m

3. Sep. 2019

Great course

von dynasty919

14. März 2018

tough course

von Zhiping L

4. Juli 2020

excellent!

von Ahmad e D

12. Nov. 2020

🔥🔥🔥🔥

von Sanket S

10. Juli 2017

good

von Nikeshkin L E

1. Okt. 2020

The course is great, it both challenging and interesting. The only one thing that I was lacking is visualisation. A lot of information/parts of algorithms explanations/theorem proofs is passed verbally and considering not triviality of that information it's hard to perceive and understand that without proper visualisation (algorithms animation/schemes/diagrams etc.).

von Oleksandr S

13. Jan. 2021

Totally the course and specialization are awesome. In this course, the explanation sometimes wasn't enough for such complex problems. At least I understood where I hare a rather big lack of knowledge and need to get the new courses.

von PLN R

25. Juni 2018

Great one for people with advanced understanding! Others will find it slightly hard to follow!

von Marko D

25. März 2020

Course is short for the topic complexity

von Zihan H

3. Mai 2018

diffcult

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.