Learner Reviews & Feedback for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them by Stanford University
About the Course
Top reviews
TL
Invalid date
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.
KA
Invalid date
Great course, great explanation from instructor. I loved how Tim Roughgarden explains algorithms. Course Load was just right for me. Great experience!
76 - 100 of 109 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
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 3, 2020
excellent！
By Reda M M G
•Feb 18, 2022
Very Good
By Ahmad D
•Nov 12, 2020
🔥🔥🔥🔥
By Shama M
•Jul 28, 2024
good
By Sanket S
•Jul 10, 2017
good