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
483 个评分
59 个审阅

课程概述

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 - Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 的 57 个评论(共 57 个)

创建者 Yuanzhan W

May 19, 2019

Great course. The videos are very instructive.

创建者 Aishwarya R

Aug 04, 2019

NP complete problems, How to tackle such exponential time problems.

创建者 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!

创建者 Subodh C

Sep 25, 2017

Need more explanatory answer sets.

创建者 Zihan H

May 03, 2018

diffcult

创建者 Xiao Z

Aug 17, 2019

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