Apr 19, 2024  
2020-2021 Academic Catalog 
    
2020-2021 Academic Catalog [Published Catalog]

Add to Portfolio (opens a new window)

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



Description
Advanced data structures. An introduction to parallel algorithms. Amortized complexity. NP-Completeness and lower-bound theory. Cook’s Theorem. Techniques for proving problems NP-complete. Complexity of parallel algorithms.

When Offered
Offered in Spring.



Add to Portfolio (opens a new window)