COMPSCIĀ 172 Computability and Complexity 4 Units
Terms offered: Fall 2024, Fall 2022, Spring 2022
Finite automata, Turing machines and RAMs. Undecidable, exponential, and polynomial-time problems. Polynomial-time equivalence of all reasonable models of computation. Nondeterministic Turing machines. Theory of NP-completeness: Cook's theorem, NP-completeness of basic problems. Selected topics in language theory, complexity and randomness.
Computability and Complexity: Read More [+]
Rules & Requirements
Prerequisites: COMPSCIĀ 170
Hours & Format
Fall and/or spring: 15 weeks - 3 hours of lecture and 1 hour of discussion per week
Additional Details
Subject/Course Level: Computer Science/Undergraduate
Grading/Final exam status: Letter grade. Final exam required.
Instructors: Papadimitriou, Seshia, Sinclair, Vazirani