- ACM Chennai Chapter by Madavan Mukund
- ACM_Chennai_Chapter
- AQIS 2013
- ATM Workshop in Operator Algebras
- Advanced Parameterized Complexity
- Algebra 2 By K N Raghavan
- Algorithms Designs and Analysis
- An Invitation to Science and Mathematics
- An introduction to Intersection Theory
- Analytic Theory of Automorphic Forms
- Aspects of Mathematics
- Bayes By The Bay 2013
- Book Release function
- Chandrayana 2011
- Clasisical topology and quantum states
- Cohomological finite generation
- Continuous Groups for Physicists
- Course on von Neumann algebras
- Creative Mathematical Sciences Communication
- Dynamic Graph Algorithm by Sayan Bhattacharya
- Effective methods in Diophantine Analysis
- Ehrhart Quasi Polynomials
- Enriching Collegiate Mathematics
- Enriching Mathematics Education workshop for teachers in schools 2013
- Enriching Mathematics Education
- Exact exponential algorithms Techniques
- FSTTCS 2010
- Frobenius s Characteristic Function
- Frontiers in Quantum Science 2012
- Frontiers of high energy Physics 2012
- Games of Imperfect Information via Automata and Logic
- Gaussian states and symmetry group
- Geometric Phases
- Geometric Representation Theory
- Graphs of Quantum Groups and K Amenability
- Hindi Day 2013
- Hindi Day 2014
- History Aspects and Prospects of Mathematics in India
- Hundred years of Fundamental Physics and a crisis
- ICLA International Conference on Logic and its Applications
- IMSC 50 Years Golden Jubilee Celebrations
- INSA Teachers Award 2013
- Indian women and mathemstics symposium 2012
- Indo-UK workshop on Computational Complexity Theory
- Infinite dimensional Lie Algebras
- Instructional Workshop on Sub factors and Planar Algebras
- Linear Algebraic Groups An Introductory Course
- MWCT 2013
- Master Class in Modular Theory
- Mathematics Aspects Prospects and a bit of History
- Mathematics Workshop for School Students 2012
- Mathematics courses
- Mathematics program for College Teachers 2012
- Mathematics seminars
- Mock Modular Forms and Physics
- Modular representations of algebraic groups
- Moduli and gauge theory on complex curves
- Nag Memorial Lecture
- One Percent Mathematics Workshop for std XI and XII
- One Percent Mathematics workshop for school students
- Open Day 2014
- Open day 2016
- Outreach Programme 2014
- Planar Algebras
- Prof A P Balachandran on Group Theory and Hopf Algebras
- Programing for Mathematics Course
- Quantum Disorder Systems
- Quantum Field Theory 2012
- Quantum Groups
- Quantum Propability
- Quantum feild theory1 : Many body theory
- Random Matrices a crash course
- Resonances
- Sage Days
- Sage
- School on Approximation Algorithms
- Science Day 2013
- Short course on Lie Groups
- Soergel bimodules and Kazhdan Lusztig theory
- Special graph
- Sunder Fest 2012
- Supersymmetry
- TCS Golden jubilee Thematic Lectures
- The function analysis of quantum information
- Theoretical Aspects of Rationality and Knowledge
- Undirected Feedback Vertex Set Kernels and approximation algorithms
- hindi day culturals 2015

#### A SURVEY OF LOGICAL REDUCTIONS BETWEEN PROBLEMS

Play time: 55m:42s

The player will show in this paragraph

- A survey of logical reductions between problems
- Lower bounds for non commutative skew circuits
- Comparator circuits over lattices
- Fixed Point Computation Problems for Algebraically Defined Functions
- Fourier Dimension and sparsity
- Lower bounds for small depth arithmetic circuits
- Phase transitions and the complexity of approximating partition functions
- Polynomial Identity Testing for a sum of ROABPs
- Proof complexity of resolution based QBF calculi
- Proof complexity
- Recent results on depth reduction and lower bounds in arithmetic complexity
- Role of composition in PCP constructions
- Satisfiability algorithms and lower bounds for boolean formulas
- Symmetric Circuits
- The Complexity of the Simplex Method
- The Dynamic Complexity of Reachability and related problems
- The complexity of Valued CSPs
- The power of super logarithmic number of players
- The shifted partial derivative complexity of elementary symmetric polynomials
- Tribes is hard in Message Passing Model
- Weighing Schemes and NL vs UL problem