Research works I have been a part of.
- If VNP is hard, then so are Equations for it,
- On Existence of Algebraically Natural Proofs,
- Near-optimal Bootstrapping Hitting Sets for Algebraic Models,
- Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees,
- with Ramprasad Saptharishi.
- Appeared in the proceedings of FST&TCS 2018.