CSCI 4172 - Complexity and Problem Solving

Theoretical and practical aspects of solving complex problems, in particular, but not limited to, NP-complete and PSPACE-complete problems. Various heuristic and approximation algorithms, including greedy, ant, and Genetic Algorithms will be studied. This course is by instructor’s permission only. 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