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 UsWhy Udacity?BlogIn the NewsJobs at UdacityBecome a MentorPartner with UdacityResourcesCatalogCareer OutcomesHelp and FAQScholarshipsResource CenterFeatured ProgramsBusiness AnalyticsSQLAWS Cloud ArchitectData AnalystIntro to ProgrammingDigital MarketingSelf Driving Car EngineerOnly at UdacityArtificial IntelligenceDeep LearningDigital MarketingFlying Car and Autonomous Flight EngineerIntro to Self-Driving CarsMachine Learning EngineerRobotics Software EngineerAI Master’sMaster of Business AdministrationMaster of Science in AIUdacity SchoolsSchool of Animation and Game DevelopmentSchool of Artificial IntelligenceSchool of Autonomous SystemsSchool of BusinessCareer ResourcesSchool of Cloud ComputingSchool of CybersecuritySchool of Data ScienceSchool of DevOpsSchool of Executive LeadershipSchool of Product ManagementSchool of Programming and Development