COP 5531 - Advanced Algorithm Design and Analysis

Credits: 3

Prerequisites: Graduate Standing
Course Description: The course covers theory of NP-completeness, methods for dealing with NP-complete problem. Selected topics in such areas as combinatorial optimization, computational geometry, cryptography, parallel algorithms. This course also discuss algorithms for graph theoretical applications, lower bounds, upper bounds, and average performance of algorithms. If time permits discussion on complexity theory will also discussed. Core results and techniques are introduced, which are useful to those planning to specialize in other areas in computer science. Moreover, some fairly advanced topics will be covered. This will provide an idea of the current research for the benefit of those who might wish to specialize in this area.