Mar 28, 2024  
2010-2011 Academic Catalog 
    
2010-2011 Academic Catalog [Published Catalog]

Add to Portfolio (opens a new window)

CSCE 525 - Algorithms and Complexity Theory


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.
(3 cr.)



Add to Portfolio (opens a new window)