# Talks

These are some of the slide-talks I have given in the last few years.

- Near-optimal Bootstrapping of Hitting Sets
- Dagstuhl Seminar on Algebraic Methods in Computational Complexity 2018

- Exponential lower bounds for hom. depth-5 circuits over finite fields
- CCC 2017, Riga, Latvia
- Source files may be found here.

- Finer separations between shallow arithmetic circuits
- FSTTCS 2016, Chennai, India
- Source files may be found here.

- Efficiently decoding Reed-Muller codes from random errors
- IIT Kanpur
- Source files may be found here.

- Functional lower bounds for arithmetic circuits
- Computational Complexity Conference (CCC 2016), Tokyo, Japan
- Source files may be found here.

- Lower bounds for shallow circuits
- Job talk, survey-ish with some high level view of the depth-5 lower bound.
- Source files may be found here.

- Depth Reduction in arithmetic circuits
- Workshop on Arithmetic Complexity Theory (WACT 2015), Saarbrucken, Germany
- Source files may be found here.

- Arithmetic Circuits: A chasm at depth three
- Approaching the chasm at depth four
- CCC 2013, Palo Alto, California, USA.
- Source files may be found here.

- Jacobians hits all circuits
- Microsoft Research India, Bangalore. 2012
- Source files may be found here.

My earlier talks can also be found @bitbucket.
You would probably need to remove some of the font declarations to be able to compile on your machine (I compile using *xelatex*).

You are free to use any of the figures.