Chevron Left
Voltar para Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Comentários e feedback de alunos de Shortest Paths Revisited, NP-Complete Problems and What To Do About Them da instituição Universidade de Stanford

4.8
estrelas
764 classificações

Sobre o curso

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

Melhores avaliações

AA

27 de fev de 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 de ago de 2018

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.

Filtrar por:

76 — 100 de 103 Avaliações para o Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

por 李培春

24 de jun de 2017

Challenge course! Good course!

por Samuel E

12 de mar de 2020

That was awesome, thank you!

por Haixu L

24 de dez de 2020

Great class. Learned a lot!

por Thomas S

25 de jan de 2018

Nice Lessons, nice Grades!

por Tsogtbayar N

10 de set de 2017

Thanks for the instructor.

por Anton B

18 de jan de 2019

Tim, thank you very much!

por Sui X

11 de jun de 2019

wow, such an good course

por zhangdi

6 de dez de 2017

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

por Yu G

6 de fev de 2021

Highly-recommended

por Jianghua F

29 de jan de 2018

Insightful course!

por Minyue D

13 de jul de 2017

Awesone Course!!!!

por Ajit B

6 de set de 2020

Terrific course!

por biswa

10 de nov de 2018

Great material!

por Dinghan X

5 de jun de 2020

Great Course

por Madhurya m

3 de set de 2019

Great course

por dynasty919

14 de mar de 2018

tough course

por Zhiping L

4 de jul de 2020

excellent!

por Reda M M G

18 de fev de 2022

Very Good

por Ahmad e D

12 de nov de 2020

🔥🔥🔥🔥

por Sanket S

10 de jul de 2017

good

por Nikeshkin L E

1 de out de 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.).

por Oleksandr S

13 de jan de 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.

por PLN R

25 de jun de 2018

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

por Marko D

25 de mar de 2020

Course is short for the topic complexity

por Zihan H

3 de mai de 2018

diffcult