|27-349 The Analysis and Design of Computer Algorithms W(3-1)|
The design and analysis of efficient computer algorithms: standard methodologies, asymptotic behaviour, optimality, lower bounds, implementation considerations, graph algorithms, matrix computations (e.g. Strassen's method), NP-completeness.
|Prerequisites: 27-190, 27-242, 63-215.|
|1996-97 Undergraduate Calendar|
Last revised: August 28, 1996. Contact: firstname.lastname@example.org.