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).
이 강좌에 대하여
귀하가 습득할 기술
- 5 stars85.42%
- 4 stars12.78%
- 3 stars1.15%
- 2 stars0.51%
- 1 star0.12%
SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM의 최상위 리뷰
Great Pace - good examples - always going to the point - clear and providing good information.
unlike previous 3 courses
some of course 4's quiz problems are really difficult and not sure how to approach...
learn a lot about algorithmic complexity class and lot's of such a beautiful algorithm. Thank you sir for sharing your knowledge with us.
Thanks a lot. It is time consuming, need a lot of thinking and practising to finish the homework. And it is worth taking. After this, we can go deep into cs.
알고리즘 특화 과정 정보
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.