|
NOTE: Course information changes frequently. Please re-visit these pages periodically for the most recent and up-to-date information. | |
Spring 2013 Computer Science W4236 section 001 INTRO-COMPUTATIONAL COMPLEXITY | |
| Call Number | 76498 |
| Day & Time Location |
MW 1:10pm-2:25pm 503 Hamilton Hall |
| Points | 3 |
| Approvals Required | None |
| Instructor | Xi Chen |
| Type | LECTURE |
| Course Description | Prerequisites: COMS W3261. Develops a quantitative theory of the computational difficulty of problems in terms of the resources (eg. 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 | CourseWorks |
| Department | Computer Science |
| Enrollment | 22 students (85 max) as of 11:25PM Tuesday, June 18, 2013 |
| Final Exam Day/Time | May 13 M 1:10pm-4:00pm |
| Final Location | 503 Hamilton Hall |
| Subject | Computer Science |
| Number | W4236 |
| Section | 001 |
| Division | Interfaculty |
| Open To | Columbia College, Engineering and Applied Science, General Studies, School of Continuing Education, Graduate School of Arts and Science, Engineering and Applied Science: Graduate, School of the Arts, International and Public Affairs, Barnard |
| Campus | Morningside |
| Section key | 20131COMS4236W001 |
Home About This Directory Online Bulletins ColumbiaWeb | |