**
Spring 2010 - Research laboratory in Foundations of Computer Science
(236649)**

**
Place: Taub **

Tuesday, **
10:30-12:30**

**
Course worksheets [PDF].**

Come and experience research in foundations of computer science. Together we will study new research directions aimed at answering fundamental questions related to algorithms and computation. The course format will be self-study (during class hours) combined with short introductory lectures.

The tentative list of topics for this semester are

- Moser's constructive proof of the Lovasz Local Lemma.
- The parallel repetition theorem, originally proved by Raz.
- Deterministic polynomial time algorithm for deciding primality, due to Agarwal, Kayal and Saxena.

The course is of theoretical nature and assumes mathematical maturity. It is especially recommended for students who have successfully took the Complexity Theory class (236313), but this is not a formal prerequisite.

Final grade based on participation in class (30%) homework (40%) and final project (30%).

**References appear in scribe notes**