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.
|
Course Number |
Call Number/ Section |
Days & Times/ Location |
Instructor | Enrollment | |
| Spring 2013 :: CSOR W4231 | |||||
|
CSOR 4231 |
98197 001 |
MW 8:40p - 9:55p 501 NORTHWEST CORNER |
Y. Zhang | 104 / 120 |
![[ More Info ]](./images/moreinfo.gif)
|
| Autumn 2013 :: CSOR W4231 | |||||
|
CSOR 4231 |
11535 001 |
TuTh 11:40a - 12:55p 501 NORTHWEST CORNER |
C. Stein | 55 / 150 |
|