Chevron Left
Вернуться к Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Отзывы учащихся о курсе Shortest Paths Revisited, NP-Complete Problems and What To Do About Them от партнера Стэнфордский университет

4.8
звезд
Оценки: 566
Рецензии: 68

О курсе

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

Feb 28, 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

Aug 23, 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.

Фильтр по:

51–66 из 66 отзывов о курсе Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

автор: Thomas S

Jan 25, 2018

Nice Lessons, nice Grades!

автор: Tsogtbayar N

Sep 11, 2017

Thanks for the instructor.

автор: Anton B

Jan 19, 2019

Tim, thank you very much!

автор: Sui X

Jun 11, 2019

wow, such an good course

автор: zhangdi

Dec 06, 2017

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

автор: Jianghua F

Jan 29, 2018

Insightful course!

автор: Minyue D

Jul 13, 2017

Awesone Course!!!!

автор: biswa

Nov 11, 2018

Great material!

автор: Madhurya R

Sep 03, 2019

Great course

автор: dynasty919

Mar 14, 2018

tough course

автор: Sanket S

Jul 10, 2017

good

автор: Aleksandar

Mar 05, 2019

Significantly more challenging when compared to the courses 1 to 3. ) I highly recommend this course, but people who are about to take this course should be aware that they will probably have to spend a bit more time.

автор: Putcha L N R

Jun 25, 2018

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

автор: Zihan H

May 03, 2018

diffcult

автор: Nguyen K T

Sep 15, 2019

so hard

автор: Xiao Z

Aug 17, 2019

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