| Call Number | 12840 |
|---|---|
| Day & Time Location |
MW 10:10am-11:25am To be announced |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Xi Chen |
| Type | LECTURE |
| Method of Instruction | In-Person |
| Course Description | Develops a quantitative theory of the computational difficulty of problems in terms of the resources (e.g. time, space) needed to solve them. Classification of problems into complexity classes, reductions, and completeness. Power and limitations of different modes of computation such as nondeterminism, randomization, interaction, and parallelism. |
| Web Site | Vergil |
| Department | Computer Science |
| Enrollment | 16 students (50 max) as of 3:06PM Tuesday, April 22, 2025 |
| Subject | Computer Science |
| Number | W4236 |
| Section | 002 |
| Division | Interfaculty |
| Open To | Barnard College, Columbia College, Engineering:Undergraduate, Engineering:Graduate, GSAS, General Studies, Journalism |
| Section key | 20253COMS4236W002 |