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, Stanford University

4.8
Оценки: 362
Рецензии: 44

Об этом курсе

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.

Фильтр по:

Рецензии: 43

автор: Thao Nguyen

Dec 15, 2018

Very challenging, but I learnt a lot from the course.

автор: Liankun Zou

Dec 02, 2018

The Course is challenging and I like it

автор: Simeon Malchev

Nov 24, 2018

Excellent course, strongly recommended!

автор: biswa

Nov 11, 2018

Great material!

автор: Ashish Dattatray Sarode

Aug 23, 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.

автор: Yiming Zhao

Aug 13, 2018

Really happy to finish this specialization and I will still study algorithms in the future.

автор: Brande George

Jul 07, 2018

Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.

автор: Jakub Czyz

Jul 01, 2018

A very nice introduction to algorithms from a high-level mathematical perspective. This course is great for building intuition about key concepts. Highly recommended. I did the Princeton algorithms course first. Both are great. The first tests one more on the implementation side and requires Java. This course is more focused on theory and a great complement. Too bad there is not a Part 5, 6, ….

автор: Putcha Lakshmi Narasimha Rahul

Jun 25, 2018

Great one for people with advanced understanding! Others will find it slightly hard to follow!

автор: Sriram Venkataraman

Jun 12, 2018

This was the hardest course in this specialization. But the quality of the course material and the instructor's way of explaining kept me engaged and motivated. The problems and the programming assignments were significantly harder than the earlier courses in this specialization - but it felt that much more satisfying after completing the course. Special thanks to Prof. Roughgarden for creating such an amazing course. :-)