Kursteilnehmer-Bewertung und -Feedback für Shortest Paths Revisited, NP-Complete Problems and What To Do About Them von Stanford University

That was awesome, thank you!

Great class. Learned a lot!

Nice Lessons, nice Grades!

Thanks for the instructor.

Tim, thank you very much!

wow, such an good course

Stanford神课，占坑留名。4/4

Highly-recommended

Insightful course!

Awesone Course!!!!

Terrific course!

Great material!

Great Course

Great course

tough course

excellent！

🔥🔥🔥🔥

good

The course is great, it both challenging and interesting. The only one thing that I was lacking is visualisation. A lot of information/parts of algorithms explanations/theorem proofs is passed verbally and considering not triviality of that information it's hard to perceive and understand that without proper visualisation (algorithms animation/schemes/diagrams etc.).

Totally the course and specialization are awesome. In this course, the explanation sometimes wasn't enough for such complex problems. At least I understood where I hare a rather big lack of knowledge and need to get the new courses.

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

Course is short for the topic complexity

diffcult

so hard

Sometimes is really hard to understand, I wish more examples and visualization rather than straightforward speech.