Activities

Problem Sets

We plan to have 6 problem sets.

1. PS 1 (5%)
2. PS 2 (8%)
3. PS 3 (8%)
4. PS 4 (8%)
5. PS 5 (8%)
6. PS 6 (8%)

Project

Project will involve thematic reading of 2-3 research papers pertaining to a topic, presentations (interim and final) and submission of a summary report.

• List of topics are as follows.
1. The complexity class PP (Dheeraj Pai)
2. Counting Complexity (Utsab)
3. The exponential Time Hypothesis (Sameer Desai)
4. Derandomization of Space bounded classes (Sagar Bisoyi)
5. The counting Hierarchy (Ankit yadav)
6. Further applications of inductive counting (Tejas Wangikar)
• The assignment of topics will be announced by 24 Jan
• Presentations will start from second week of Apr.

List of topics

Examination

There will be an end semester examination.
End semester exam : 10:00 - 12:00 07 May, 2018