CSOR W 4231x Analysis of Algorithms I
Introduction to the design and analysis of efficient algorithms. Topics
include models of computation, efficient sorting and searching, algorithms
for algebraic problems, graph algorithms, dynamic programming, probabilistic
methods, approximation algorithms, and NP-completeness. - M. Yannakakis
Prerequisites: COMS W3137 or W3139, and W3203. General Education Requirement: Quantitative and Deductive Reasoning (QUA).
3 points Lect: 3.