Intro to Theoretical Computer Science Lesson 1.1 - Challenging ProblemsLesson 1.2 - Algorithm Analysis and the RAMLesson 1.3 - Big O (Optional)Lesson 1.4 - Connecting Similar ProblemsProblem Set 1Lesson 2.1 - Many Solutions and IntractabilityLesson 2.2 - Non-deterministic RAMLesson 2.3 - SATLesson 2.4 - Proof of SAT (Optional)Lesson 2.5 - NP-Completeness Via ReductionsProblem Set 2Lesson 3 - Solving NP-Complete ProblemsProblem Set 3Lesson 4.1 - Pruning the InputLessons 4.2 - PreprocessingLesson 4.3 - Measuring HardnessProblem Set 4Lesson 5.1 - Approximation FactorLesson 5.2 - Shortest TourLesson 5.3 - Reductions & Approx. FactorsLesson 5.4 - PTASProblem Set 5Lesson 6.1 - RandomizationLesson 6.2 - What You've LearntProblem Set 6Lesson 7.1 - Limits of ComputationLesson 7.2 - More UndecidabilityProblem Set 7ExamCompanyAbout Us Why Udacity? Blog In the News Jobs at Udacity Become a Mentor Partner with Udacity ResourcesCatalog Career Outcomes Help and FAQ Scholarships Resource Center Udacity SchoolsSchool of Artificial Intelligence School of Autonomous Systems School of Business School of Cloud Computing School of Cybersecurity School of Data Science School of Executive Leadership School of Product Management School of Programming and Development Career Resources Featured ProgramsBusiness Analytics SQL AWS Cloud Architect Data Analyst Intro to Programming Digital Marketing Self Driving Car Engineer Only at UdacityArtificial Intelligence Deep Learning Digital Marketing Flying Car and Autonomous Flight Engineer Intro to Self-Driving Cars Machine Learning Engineer Robotics Software Engineer