Chevron Left
Voltar para Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Comentários e feedback de alunos de Shortest Paths Revisited, NP-Complete Problems and What To Do About Them da instituição Universidade de Stanford

4.8
estrelas
751 classificações
102 avaliações

Sobre o curso

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)....

Melhores avaliações

AA
27 de Fev de 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
22 de Ago de 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.

Filtrar por:

101 — 101 de 101 Avaliações para o Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

por Xiao Z

17 de Ago de 2019

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