Learner Reviews & Feedback for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them by Stanford University
About the Course
Top reviews
DZ
Feb 15, 2021
Really great and challenging course. Gives a strong foundation in np-complete problems and the approximate methods for making progress on these challenging problems.
HP
May 5, 2020
learn a lot about algorithmic complexity class and lot's of such a beautiful algorithm. Thank you sir for sharing your knowledge with us.
76 - 100 of 112 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
By Simeon M
•Nov 24, 2018
Excellent course, strongly recommended!
By Ivan
•Dec 30, 2024
Brilliant lector, great material!
By Dilyan M
•Feb 6, 2019
Very challenging, but worthwhile.
By B B
•Mar 3, 2017
Very challenging, well presented.
By 李培春
•Jun 24, 2017
Challenge course! Good course!
By Samuel E
•Mar 12, 2020
That was awesome, thank you!
By Haixu L
•Dec 24, 2020
Great class. Learned a lot!
By Thomas S
•Jan 25, 2018
Nice Lessons, nice Grades!
By Tsogtbayar N
•Sep 10, 2017
Thanks for the instructor.
By Anton B
•Jan 18, 2019
Tim, thank you very much!
By Xiaozizhen
•Nov 28, 2022
Excellent online course.
By Sui X
•Jun 11, 2019
wow, such an good course
By zhangdi
•Dec 6, 2017
Stanford神课，占坑留名。4/4
By Yu G
•Feb 6, 2021
Highly-recommended
By Jianghua F
•Jan 29, 2018
Insightful course!
By Minyue D
•Jul 13, 2017
Awesone Course!!!!
By Ajit B
•Sep 6, 2020
Terrific course!
By biswa
•Nov 10, 2018
Great material!
By Dinghan X
•Jun 5, 2020
Great Course
By Madhurya m
•Sep 3, 2019
Great course
By dynasty919
•Mar 14, 2018
tough course
By Gagan N
•Oct 27, 2023
good course
By Zhiping L
•Jul 4, 2020
excellent！
By Reda M M G
•Feb 18, 2022
Very Good
By Ahmad D
•Nov 12, 2020
🔥🔥🔥🔥