The Fields institute
and |
CSC 2402H
|
|
Lecture: | Tuesday 15-17, The Fields Institute, Stewart Library | |
---|---|---|
Instructors: | Avner Magen and Toniann Pitassi | |
Office hours: | by appointment (SF 2301B, 946-8672). | |
Tutor: |
Siavosh Benabbas |
The course deals with systematic approaches, based on algebric and geometric reasoning to deal with intractibilitiy (aka NP-hardness).
The course will assume very little knowledge about computability and Complexity theory, and still will attempt to deliver toward its
later stages advanced concepts and state-of-the-art topics in the relevant theory, including open questions.
The course will consist of four parts.
There will be 4 problem sets that will make up the grade for this course.
There is no real text for the course. Here is a list for recommended ones.
Date | Announcement(s) |
---|---|
29/11 |
Please email your electronic ex4 to siavosh (siavosh@cs) and if you write your work by hand, please leave your papers with Elizabeth Ribeiro, SF 2301D by the due date. |
29/11 |
Assigmnet 4 was uploaded. |
30/10 |
Assigmnet 2 was uploaded. |
27/10 |
Tutorial Thursday 29/10 at 10:00. Location: Bahen 3004. Topics: Duality theorem and ellipsoid algorithm. |
11/10 |
typo fixed in A1. Upload again to get the correct version. (A_{ij} = -x_{ji} when i>j and ij an edge. In other words, an entry corresponding to an edge is the negation of its symmetric entry.) |
7/10 |
Tutorial tomorrow 8/10 at 10:00. Location: Bahen 3004. |
6/10 |
Assigmnet 1 was uploaded. |
22/9 |
Class will continue to be held in Stewart library in the Fields (same place as lecture 2). |
9/9 |
Welcome to the course's webpage. First class on Monday 14/9, 3-5pm, Fields room 230. |