Indo-UK workshop on Computational Complexity Theory

# You can also click the upper-left icon to select videos from the playlist.

source: matsciencechannel    2015年1月14日

Neeraj Kayal : Recent results on depth reduction and lower bounds in arithmetic complexity. 57:57
Srikanth Srinivasan : Lower bounds for non-commutative skew circuits 40:09
Nutan Limaye : The shifted partial derivative complexity of elementary symmetric polynomials 34:12
Chandan saha : Lower bounds for small depth arithmetic circuits 54:47
Sagnik Mukhopadhyay : Tribes is hard in Message Passing Model 31:06
Swagato Sanyal : Fourier Dimension and sparsity 24:53
Leslie Goldberg : Phase transitions and the complexity of approximating partition functions 55:02
Stanislav Zivny : The complexity of Valued CSPs 53:52
Iain Stewart : A survey of logical reductions between problems 55:43
Kousha Etessami : Fixed Point Computation Problems for Algebraically Defined Functions... 1:03:02
Samir Datta : The Dynamic Complexity of Reachability and related problems 51:16
Rahul Savani : The Complexity of the Simplex Method 37:56
Olaf Beyersdorff : Proof complexity 59:19
Leroy Chew : Proof complexity of resolution-based QBF calculi 26:59
Ruiwen Chen : Satisfiability algorithms and lower bounds for boolean formulas 33:43
Anuj Dawar : Symmetric Circuits 56:13
Balagopal Komarath : Comparator circuits over lattices 30:19
Arpita Korwar : Polynomial Identity Testing for a sum of ROABPs 31:29
Prahladh Harsha : Role of composition in PCP constructions 1:00:00
Arkadev Chattopadhyay : The power of super-logarithmic number of players 39:31
Jayalal Sarma : Weighing Schemes and NL vs UL problem 49:22