Talks and Presentations
A Brief Survey on Debordering Paradigms and Its Recent Advances [slides][video].
A Brief Survey on Polynomial Identity Testing [slides].
CSE Seminar, IIIT Delhi; October'24.
CSE Seminar, IIT Delhi; October'24.
Recent Advances in Polynomial Identity Testing [slides].
2024 Oberwolfach Complexity Meeting [Invited Plenary Talk], Germany; June'24.
CS Seminar, University of Ulm, Germany; June'24.
Unified Approach to Lower Bounds and Derandomization [slides].
Border rank, homogeneity and de-bordering paradigms in GCT [slides].
Fundamental Algorithms and Algorithmic Complexity Workshop at Institut Henri Poincaré, Paris; September'23.
Bangalore Theory Seminar series, IISc Bangalore, Feb'24.
CQT Theory Seminar, Singapore, April'24.
Polynomial Factorization: Recent advances, and challenges [slides].
From Hilbert's Entscheidungsproblem to Mulmuley's Geometric Complexity: Where algebra meets computation [slides].
On the border complexity of binomials (& more) [slides].
Theory Seminar, IIT Bombay; Nov'22.
ACMU Seminar, ISI Kolkata; Dec'22.
tMeet, IIT Madras; Dec'22.
Theory Seminar, NUS; Feb'23.
Power and limitation of border depth-3 algebraic circuits.
AG1 Mittagsseminar, Max-Planck-Institut für Informatik (MPI); September'22.
(Online) Theory Seminar, IIT Bombay; Aug'22.
Exponential-gap fanin-hierarchy for border depth-3 circuits [slides][video].
Conference Presentation @FOCS'22; Oct'22.
Kolloquium, TU Berlin; June'22.
(Online) Conference on Geometric Complexity Theory (GCT 2022); Jan'22.
Demystifying the Border depth-3 algebraic circuits [poster][slides][video].
(Online) CSTAR Seminar, IIIT Hyderabad; Feb'22
(Online) Oxford-Warwick Complexity Seminar; Nov'21.
(Online) TCS Webinar, CMI; Nov'21
(Online) Theory Open Mic Seminar, Georgetown University; Nov'21.
(Online) Poster Presentation, Google PhD Fellowship Summit 2021, September'21.
Real \tau-Conjecture for Sum-of-squares: A Unified Approach to Lower Bound and Derandomization [slides].
MC2 Seminar, ENS Lyon; June'22.
(Online) Conference Presentation, CSR 21; June'21.
(Online) ACMU Seminar, ISI Kolkata; June'21.
(Online) TCS Seminar, CMI; May'21.
A Largish Sum-of-Squares Implies Circuit Hardness and Derandomization [slides].
From Sum-of-Squares (SOS) to hardness and derandomization [slides].
Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT [slides][video]
Lower bound and Complexity Theory.
A brief survey on univariate lower bounds.
Some results on factoring and its applications.
Discovering the roots: Uniform closure results for algebraic classes under factoring.
Poster Presentation, STOC’18, Los Angeles; July'18.
Kolloquium, Institut für Mathematik, Fachgebiet Algorithmische Algebra, TU Berlin; May'18.
AG1 Mittagsseminar, Max-Planck-Institut für Informatik (MPI), Saarbrücken; May'18.
Workshop on Algebraic Complexity Theory (WACT) 2018, Universite Paris Diderot, Paris; March'18
tMeet, CSE IIT Madras; Jan'18.
TCS Seminar, CMI; Oct'17.
Finding square-root mod p [slides].