The design and analysis of efficient computer algorithms are studied. Topics which will be studied include: standard methodologies, asymptotic behaviour, optimality, lower bounds, implementation considerations, graph algorithms, matrix computations (e.g. Strassen’s method), NP-completeness.)
Posted On : December 8, 2010
Comment :
Posted On : October 25, 2010
Comment :