Jun 21, 2018  
2017-2019 Graduate Catalog 
    
2017-2019 Graduate Catalog
[Add to Portfolio]

APM 5610 - Algorithms and Complexity

(4 credits)

A general introduction to algorithm design and analysis, including study of the following algorithmic techniques: divide-and-conquer, 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.  Required background: a course in discrete mathematics and knowledge of data structures.  Formerly APM 567.  Cannot receive credit for both APM 5610 and CSE 5610.

Prerequisite(s): Required background: a course in discrete mathematics and knowledge of data structures.

Course revisions made after the Graduate Catalog publication date will be posted in the Graduate Catalog Addendum.



[Add to Portfolio]