(3 units). Theory of NP-completeness, methods for dealing with NP-complete problems. Selected topics in such areas as combinatorial optimization, computational geometry, cryptography, parallel algorithms. Course Component: Lecture Prerequisite: CSI 3105.
(3 units). Theory of NP-completeness, methods for dealing with NP-complete problems. Selected topics in such areas as combinatorial optimization, computational geometry, cryptography, parallel algorithms. Course Component: Lecture Prerequisite: CSI 3105.
