Shortest Paths Revisited, NP-Complete Problems and What To Do About Them(으)로 돌아가기
스탠퍼드 대학교의 Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 학습자 리뷰 및 피드백
764개의 평가
강좌 소개
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
2017년 2월 27일
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
2018년 8월 22일
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.
필터링 기준:
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them의 103개 리뷰 중 101~103
교육 기관: Thành N K
•2019년 9월 15일
so hard
교육 기관: --
•2021년 4월 27일
Sometimes is really hard to understand, I wish more examples and visualization rather than straightforward speech.
교육 기관: Xiao Z
•2019년 8월 17일
Can be expanded more. Some of the quizzes are too hard.
Coursera Footer
© 2022 Coursera Inc. All rights reserved.
