| Call Number | 17552 |
|---|---|
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Xi Chen |
| Type | LECTURE |
| Method of Instruction | On-Line Only |
| 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 | Video Network |
| Enrollment | 4 students (99 max) as of 9:05PM Wednesday, April 2, 2025 |
| Subject | Computer Science |
| Number | W4236 |
| Section | V01 |
| Division | Interfaculty |
| Fee | $395 CVN Course Fee |
| Note | VIDEO NETWORK STUDENTS ONLY |
| Section key | 20243COMS4236WV01 |