CMSC 28100
Introduction to Complexity Theory (MATH 28100)Prerequisites: MATH 25000 or 25500 or CMSC 27100, and experience with mathematical proofs.
Catalog Description: Computability topics are discussed (e.g., the s-m-n theorem and the recursion theorem, resource-bounded computation). This course introduces complexity theory. Relationships between space and time, determinism and non-determinism, NP-completeness, and the P versus NP question are investigated.
Instructors: K. MulmuleyQuarter offered: Spring
Last Verified by Sharon Salveter on 8 April, 2003.