This site uses cookies. By continuing to use this site, closing this banner, or clicking "I Agree", you agree to the use of cookies.
Read our cookies policy and privacy statement for more information.
Stand with UkraineDonate
- Home
- Colorado
- University of Colorado Denver/Anschutz Medical Campus
- Course info
- csci-4172 - complexity-and-problem-solving
University of Colorado Denver/Anschutz Medical Campus Course Info
Denver, Colorado•
10 reviews
Course Info
Search for courses by clicking on letters of the alphabet or by using a search bar. Explore course description, number of credits required and course sequences to satisfy graduation requirements.
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 instructors permission only
Units: 3.0
Hours: 3 to 3
Prerequisites:
CSCI 5446 - Theory of Automata
or
CSCI 4034 - Theoretical Foundations of Computer Science