Jul 22, 2024  
2013-2014 Academic Catalog 
    
2013-2014 Academic Catalog [Published Catalog]

Add to Portfolio (opens a new window)

CSCE 525/5221 - Algorithms and Complexity Theory (3 cr.)



Description
Measures of the complexity of algorithms. Amortized complexity. Greedy algorithms. Dynamic programming. NP-Completeness and lower-bound theory. Cook’s Theorem. Techniques for proving problems NP-complete. Complexity of parallel algorithms. Well-parallelizable and hardly-parallelizable problems.


Check course scheduling information




Add to Portfolio (opens a new window)