Aug 12, 2022  
2021-2022 Catalog 
    
2021-2022 Catalog [ARCHIVED CATALOG]

Add to My Favorites (opens a new window)

CS 613 - Advanced Computational Complexity

Units: 3
In-depth discussion of computational complexity theory including models of computation, polynomially bounded, NP-completeness, reducibility, and beyond NP-completeness, and intractable problems. NP-complete problems in various areas will be discussed.

Prerequisite(s): CS 513 .



Add to My Favorites (opens a new window)