|
Sep 02, 2024
|
|
|
|
APM 567 - Algorithms and Complexity (4 credits)
A general introduction to algorithm design and analysis, including study of the following algorithmic techniques: divide-andconquer, greedy methods, backtracking, preconditioning and precomputation, probabilistic and approximation algorithms. Topics covered also include: the fast Fourier transform, lower bound theory, reduction and NP-completeness.
Prerequisite(s): Required background: a course in discrete mathematics and knowledge of data structures.
Course updates made after the Graduate Catalog publication date will be posted in the Addendum to the Graduate Catalog.
Add to Portfolio (opens a new window)
|
|