Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
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
Units: 3.0
Hours: 3 to 3