Please note:
To view the current Academic Calendar go to www.sfu.ca/students/calendar.html
Approximation and Randomized Algorithms CMPT 712 (3)
Discrete optimization of nondeterministic polynomial time (NP) hard problems, design and analysis of approximation and randomized algorithms, and the applications of theoretical analysis to the study of heuristics will be covered in this course.