CS640 - Computational Complexity Theory (Sem II, 2013-14)

 

Extra talks

Note: The schedule is subject to change. Check back for changes and updates

 
Talks in CS103 from 10:30-11:50am, each for 35mins

Date Slot
 Speaker  Topic
1.
30-Mar (Sun)
10:30-11:10
Shahbaz Khan
Model for Incremental computations [pdf]
2.

11:10-11:50
Keerti Chaudhary
Reingold's graph reachability in log space [pdf]
3.
05-Apr (Sat)
10:30-11:10
Shubham Sahai Srivastava
Primality Testing : Is randomization worth practicing? [pdf]
4.

11:10-11:50
Sumit Sidana
AKS primality test [pdf]
5.
06-Apr (Sun)
10:30-11:10
Utkarsh Patange
Hastad's parity is not in AC_0 [pdf]
6.

11:10-11:50
Shaik Naseer
Hastad's parity is not in AC_0 [pdf]
7.
12-Apr (Sat)
10:30-11:10
Rishabh Vaid
Williams' NEXP is not in ACC_0 [pdf]
8.

11:10-11:50
Anurag Sahay
<Cancelled>
9.
13-Apr (Sun)
10:30-11:10
Tanvi Soni
Planar reachability reduces to grid-graph reachability [pdf]
10.

11:10-11:50
Massand Sagar Sunil
Directed planar reachability in unambiguous logspace [pdf]
11.
15-Apr (Tue)
10:30-11:10
Sakaar Khurana Natural proofs barrier [pdf]
12.

11:10-11:50
Anurag Pandey
Shor's integer factoring [pdf]