CSI 4105 Design and Analysis of Algorithms II
3 crédits
Informatique
Faculte de genie
Theory of NP-completeness, methods for dealing with NP-complete problems. Selected topics in such areas as combinatorial optimization, computational geometry, cryptography, parallel algorithms.
Volet:
Cours magistral
Exigences:
Prerequisite: CSI 3105 .
Terme proposées précédemment:
Automne
Équivalent Français: