| Call Number | 18056 |
|---|---|
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Rocco Servedio |
| Type | LECTURE |
| Method of Instruction | On-Line Only |
| 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 | Video Network |
| Enrollment | 3 students (99 max) as of 11:39PM Thursday, May 8, 2025 |
| Subject | Computer Science |
| Number | W4236 |
| Section | V01 |
| Division | Interfaculty |
| Campus | Video Network |
| Fee | $395 CVN Course Fee |
| Note | VIDEO NETWORK STUDENTS ONLY |
| Section key | 20231COMS4236WV01 |