Oct 19, 2019  
2018-19 CATALOG 
    
2018-19 CATALOG [ARCHIVED CATALOG]

[Add to My Favorites]

CS 513 - Analysis and Intractability of Algorithms

Units: 3
Study of algorithms; efficient, optimal algorithms and analysis for best, worst, and average performance; computational complexity theory; algorithmic time and space bounds; levels of intractability including polynomial-time reducibility, NP-complete and NP-hard problems, and Co-NP; applications. A core course in the Computer Science M.S. program. Undergraduates must obtain consent of instructor to enroll.

Prerequisite(s): For undergraduates and enrollment requirement For graduate students: CS 311 .



[Add to My Favorites]