CS 306 - Computability, Complexity, and Heuristics
Using abstract machine models to measure the complexity of computational problems and to explore the limits of computational power. In addition, students will investigate strategies to deal with intractable computational problems when they arise. Topics include finite automata, Turing machines, undecidability, NP-completeness, approximation algorithms, heuristic algorithms, and experimental algorithmics.
Prerequisites: CS 305 .
Add to Portfolio (opens a new window)