|
Jan 02, 2025
|
|
|
|
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.
Check course scheduling information
Add to Portfolio (opens a new window)
|
|