On the Hardness of Order Finding and Equivalence Testing for ROABPs
with Pratik Shastri
FSTTCS 2025
Efficient Polynomial Identity Testing Over Nonassociative Algebras
with Pratik Shastri and Partha Mukhopadhyay
RANDOM 2025
Lower Bounds for Planar Arithmetic Circuits
with Pratik Shastri
Appeared in ACM Transactions on Computation Theory
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field
with V. Arvind, Abhranil Chatterjee, Utsab Ghosal and Partha Mukhopadhyay
On finer separations between subclasses of Read-once Oblivious ABPs
with Anamay Tengse.
If VNP is hard then so are equations for it.
with Mrinal Kumar, Ramprasad Saptharishi and Anamay Tengse.
On the Existence of Algebraically Natural Proofs
with Prerona Chatterjee, Mrinal Kumar, Ramprasad Saptharishi and Anamay Tengse.
Journal version in Computational Complexity.
Lower Bounds for special cases of Syntactic Multilinear ABPs
with B.V. Raghavendra Rao.
Appeared in Theoretical Computer Science
Preliminary version in COCOON 2018.
Minimum Membership Hitting Sets of Axis Parallel Segments
with S. M. Dhannya and N. S. Narayanaswamy
Linear projections of the Vandermonde polynomial
with B.V. Raghavendra Rao.
Appeared in Theoretical Computer Science
Lower bounds for Sum and Sum of Products of Read-once Formulas
with B.V. Raghavendra Rao.
Appeared in ACM Transactions on Computation Theory
Preliminary version in FSTTCS 2016.
Recent Progress on Matrix Rigidity
A survey on the long-standing open problem of constructing an explicit family of rigid matrices.
Under Review with Theory Of Computing.
My PhD thesis was awarded the IBM Best PhD thesis award for 2019.
INSPIRE Faculty Fellowship(2021-2026) awarded by the Department of Science and Technology(DST).