|
NOTE: Course information changes frequently, including Methods of Instruction. Please revisit these pages periodically for the most recent and up-to-date course information. | |
Spring 2023 Computer Science W4236 section 001 INTRO-COMPUTATIONAL COMPLEXITY INTRO-COMPUTATIONAL COMPL | |
| Call Number | 12835 |
| Day & Time Location |
MW 8:40am-9:55am 524 Seeley W. Mudd Building |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Rocco Servedio |
| Type | LECTURE |
| Method of Instruction | In-Person |
| Course Description | Prerequisites: (COMS W3261) 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 | 43 students (55 max) as of 9:09PM Friday, March 24, 2023 |
| Subject | Computer Science |
| Number | W4236 |
| Section | 001 |
| Division | Interfaculty |
| Campus | Morningside |
| Section key | 20231COMS4236W001 |
Home About This Directory Online Bulletins ColumbiaWeb SSOL | |