syllabus

syllabus - CS 151 Complexity Theory Spring 2011 Course...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 151 Complexity Theory Spring 2011 Course Summary and Syllabus Lecturer: Chris Umans Date: March 29 Course summary: Complexity Theory attempts to answer the question: What is computationally feasible given limited com- putational resources? In this course we will lay out a surprisingly rich landscape of complexity classes that are used to classify problems according to the resources (such as time, space, randomness, or parallelism) required for their solution. We will build a detailed picture of how these classes are believed to fit together, and we will prove that some pieces of this picture are indeed correct. The question of whether the remainder of this picture is correct encompasses some of the deepest and most fundamental open problems in computer science, including P ? =NP and many others. Course Information: Instructor: Chris Umans ( [email protected] ) TAs: Arda Antikacioglu ( [email protected] ) Patrick Xia ( [email protected] ) Lectures: Tuesdays and Thursdays 1:00 – 2:25 in Annenberg 105 Office hours: TBD
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 2

syllabus - CS 151 Complexity Theory Spring 2011 Course...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online