Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
A solid, in-depth theoretical foundations in computing, computational complexity, and algorithmics. Various algorithms, including both discrete and non-discrete problem domains. NP-complete and other complete classes of problems/languages
Units: 3.0
Hours: 3 to 3