Dealing with Challenging ProblemsStart Free Course
This class teaches you about basic concepts in theoretical computer science -- such as NP-completeness -- and what they imply for solving tough algorithmic problems.Play Trailer Play Trailer
This free course is your first step towards a new career with the Senior Web Developer Nanodegree Program.
Enhance your skill set and boost your hirability through innovative, independent learning.
An introduction to tough problems and their analysis
What we mean when a problem is “hard” and the concept of NP-completeness
Tools to let you recognize and prove that a problem is hard
Smart techniques to solve problems that should – theoretically – be impossible to solve
Gaining speed by accepting approximate solutions
Why randomness can be of help – sometimes. An introduction to complexity classes.
Problems that no computer can ever solve. In theory.
At the end of this course, you will have a solid understanding of theoretical computer science. This will not only allow you to recognize some of the most challenging algorithmic problems out there, but also give you powerful tools to deal with them in practice.