About the content
This class teaches you about basic concepts in theoretical computer science -- such as NP-completeness -- and what they imply for solving tough algorithmic problems.
Lesson 1: Challenging ProblemsAn introduction to tough problems and their analysis
Lesson 2: Understanding HardnessWhat we mean when a problem is “hard” and the concept of NP-completeness
Lesson 3: Showing HardnessTools to let you recognize and prove that a problem is hard
Lesson 4: Intelligent ForceSmart techniques to solve problems that should – theoretically – be impossible to solve
Lesson 5: Sloppy SolutionsGaining speed by accepting approximate solutions
Lesson 6: Poking AroundWhy randomness can be of help – sometimes. An introduction to complexity classes.
Lesson 7: Ultimate LimitsProblems that no computer can ever solve. In theory.
- Sebastian Wernicke - Sebastian studied Bioinformatics at Universität Tübingen and holds a Ph.D. from Universität Jena in Germany, where his research focused on finding efficient algorithms for computationally hard problems on biological networks. After several years of strategic consulting for pharma companies and financial services, he's currently working with Seven Bridges Genomics, a big data bioinformatics startup. He is also well-known for his TED Talks, especially the one on the statistics of TED Talks..
Udacity is a for-profit educational organization founded by Sebastian Thrun, David Stavens, and Mike Sokolsky offering massive open online courses (MOOCs). According to Thrun, the origin of the name Udacity comes from the company's desire to be "audacious for you, the student". While it originally focused on offering university-style courses, it now focuses more on vocational courses for professionals.