CSCI 4173 - Computational Complexity and Problem Solving

Solid, in-depth theoretical foundation in computing, computational complexity, and algorithmics. Additional topics include various algorithms for both discrete and non-discrete problem domains. Models of Computation, Computational Complexity, Time Complexity Classes, Space Complexity Classes, The Theory of NP-completeness. Prereq: Grade of C- or higher in CSCI 4034. Restriction: Restricted to Computer Science Majors and Minors. Max Hours: 3 Credits. Semester Hours: 3 to 3