CS6850 : Computational Complexity Theory
CS6850 : (Topics in) Complexity Theory
Home               Information               Lectures               Problem Sets               References

CS6850: Project Presentations

Past Allotted

MarchSpeaker Schedule Topic
Apr 16 Rikin Kachhia 2pm-3pm Monotone Circuit Lower Bounds - I
Apr 16 Ashish Kashyap 3pm-4pm Monotone Circuit Lower Bounds - II
Apr 16 Gaurav Maheswari 4pm-5pm Structural Properties of PP
Apr 19 Sajin Koroth 5:30pm-6:30pm Arithmetic Circuits - A Chasm at Depth 4
Apr 20 Mrinal Kumar 5:30pm-6:30pm Infeasibility of Instance Compression
Apr 21 Prateek Barapatre 4:30pm-5:30pm Introduction to Zero Knowledge Proof Systems
Apr 21 Kritika Ramaswamy 5:30pm-6:30pm Zero Knowledge Proof Systems for some graph problems
Apr 23 Balagopal Komarath 2pm-3pm Crossing Sequences and Their Applications
Apr 27 Praneel Raja 2:30pm-4pm Saving space using Pebbling Arguments
Apr 27 Abhinay Sama 4:30pm-5:30pm Discrepancy Method in Lower Bounds
May 3 Nalini Behera 11:00am-12:00pm Polylog Threshold is in AC^0
May 3 Prateek Barapatre 12:00pm-1:00pm Zero knowledge proofs for NP




Last updated on Fri May 13 21:08:49 IST 2011