Mar 29, 2024  
2017-2018 Graduate Catalog 
    
2017-2018 Graduate Catalog [ARCHIVED CATALOG]

CS 552. Applied Complexity Theory


3.00
Algorithms (sorting and searching, graph theory, arithmetic) with space and time complexity and analyses; formal models of computation; theoretical aspects of computational complexity, including complexity measures and hierarchies, intractable problems, and the P=NP question. Other topics in theoretical computer science with applications. Prerequisite Unconditional admission as a computer science graduate student.