CSE 522
Design and Analysis of Algorithms II
Analysis of algorithms more sophisticated than those treated in CSE 521. Content varies and may include such topics as algebraic algorithms, combinational algorithms, techniques for proving lower bounds on complexity, and algorithms for special computing devices such as networks or formulas. Prerequisite: CSE 521.
Sources
- Course catalogue ↗Current public catalogue; retrieved 2026-11-05