| Call Number | 13263 |
|---|---|
| Day & Time Location |
MW 2:40pm-3:55pm To be announced |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Daniel Bienstock |
| Type | LECTURE |
| Method of Instruction | In-Person |
| Course Description | Prerequisites: COMS W3134, COMS W3136, or COMS W3137, and COMS W3203. 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. |
| Web Site | Vergil |
| Department | Industrial Engineering and Operations Research |
| Enrollment | 0 students (65 max) as of 11:06AM Tuesday, October 14, 2025 |
| Subject | Computer Science and Operations Research |
| Number | E4231 |
| Section | 001 |
| Division | School of Engineering and Applied Science: Graduate |
| Open To | Engineering:Undergraduate, Engineering:Graduate |
| Section key | 20261CSOR4231E001 |