CSI 4105 Design and Analysis of Algorithms II
3 units
Computer Science
Faculty of Engineering
Theory of NP-completeness, methods for dealing with NP-complete problems. Selected topics in such areas as combinatorial optimization, computational geometry, cryptography, parallel algorithms.
Components:
Lecture
Requirements:
Prerequisite: CSI 3105 .
Previously Offered Terms:
Fall
French Equivalent: