Directory of Classes
NOTE: Course information changes frequently. Please re-visit these pages periodically for the most recent and up-to-date information.

Spring 2014 Computer Science W4236 section 001
INTRO-COMPUTATIONAL COMPLEXITY

Call Number 63867
Day & Time
Location
MW 2:40pm-3:55pm
535 Seeley W. Mudd Building
Points 3
Approvals Required None
Instructor Mihalis Yannakakis
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 31 students (40 max) as of 11:53PM Wednesday, August 20, 2014
Final Exam Day/Time May 14
W 1:10pm-4:00pm
Final Location 535 Seeley W. Mudd Building
Subject Computer Science
Number W4236
Section 001
Division Interfaculty
Open To Columbia College, Engineering and Applied Science: Undergraduate, General Studies, School of Continuing Education, Global Programs, Graduate School of Arts and Science, School of the Arts, International and Public Affairs, Barnard, Engineering and Applied Science: Graduate
Campus Morningside
Section key 20141COMS4236W001

Home      About This Directory      Online Bulletins      ColumbiaWeb
SIS update 08/20/14 23:53    web update 08/21/14 15:02