Publications

• Monotone Bounded-Depth Complexity of Homomorphism Polynomials (arXiv)
  • with Shiteng Chen, Radu Curticapean, and Prateek Dwivedi
  • MFCS 2025
• Learning the coefficients: A presentable version of border complexity and applications to circuit factoring
  • with Prateek Dwivedi and Nitin Saxena
  • STOC 2024
• Lower bounds for the sum of small-size algebraic branching programs
  • with Prateek Dwivedi and Nitin Saxena
  • Theoret. Comput. Sci., TCS 2025 (invited special issue of TAMC 2024)
• Improved lower bound, and proof barrier, for constant depth algebraic circuits
  • with Sagnik Dutta and Nitin Saxena
  • ACM Trans. Comput. Theory, TOCT 2024 (preliminary version - MFCS 2022)
  • awarded Best Student Paper at MFCS 2022

Manuscripts

• A primer on the closure of algebraic complexity classes under factoring (arXiv, ECCC, PDF)
  • with Prateek Dwivedi and Nitin Saxena
  • under review in the special issue of the workshop RTCA’23, Paris

Theses

• On Problems of Hardness, Counting, and Factoring in Algebraic Complexity
  • PhD thesis, Indian Institute of Technology Kanpur, 2025
• Geometry of Polynomials
  • Master’s thesis, Chennai Mathematical Institute, 2019