CS640 - Computational Complexity Theory (Sem I, 2017-18)

 

Extra talks

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

 
Talks in KD102 from --, each for 35mins

Date Slot
  Speaker  Topic
1.
 11-Nov-2017
 10:30am Prateek Gupta
Directed Planar Reachability is in Unambiguous Log Space [pdf]
2.
11:10am
 Ashish Dwivedi
Hilbert Nullstellensatz is in Polynomial Hierarchy [pdf]