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
782 个评分

课程概述

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 27, 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 22, 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.

筛选依据:

1 - Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 的 25 个评论(共 104 个)

创建者 Yusuke U

Dec 23, 2018

创建者 Cindy T

May 31, 2018

创建者 Jakub C

Jul 1, 2018

创建者 Nelson L W

May 27, 2017

创建者 Subodh C

Sep 25, 2017

创建者 GongPing

Sep 7, 2017

创建者 Aleksandar

Mar 5, 2019

创建者 Besher A M

Dec 31, 2019

创建者 Jemaal K

Feb 16, 2019

创建者 Yixian H

Jan 2, 2020

创建者 Jephte E

Dec 27, 2019

创建者 Minsub L

Nov 13, 2019

创建者 Pranjal V

Nov 23, 2017

创建者 Rúben G

May 13, 2020

创建者 Nikita T

Aug 8, 2021

创建者 Yuxing C

Apr 10, 2020

创建者 Christopher P

Aug 2, 2020

创建者 Mikhail K

Apr 5, 2020

创建者 Sergey T

Aug 2, 2020

创建者 Richard P

Jan 7, 2018

创建者 Sriram V

Sep 6, 2020

创建者 Katrina C

Apr 17, 2020

创建者 Xiaokang W

Jul 23, 2017

创建者 jeremy j

Apr 3, 2020

创建者 Toshikazu Y

Oct 31, 2019