Publications (in the reverse chronological order, the order of authorship is usually alphabetical):
2024
On Fourier analysis of sparse Boolean functions over certain Abelian groups [pdf].
With Arijit Ghosh (ISI Kolkata), Swagato Sanyal (IIT Kharagpur), Swarnalipa Datta (ISI Kolkata), and Sourav Chakraborty (ISI Kolkata).
To appear in the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024).
Advances in Polynomial Identity Testing [pdf][Survey].
With Sumanta Ghosh (CMI).
Invited to write a survey for SIGACT News Complexity Theory Column.
Improved Lower Bounds for 3-Query Matching Vector Codes [pdf].
Joint work with Divesh Aggarwal (NUS), Zeyong Li (NUS), Maciej Obremski (NUS), Sidhant Saraogi (Georgetown University).
Submitted.
Exponential lower bounds via exponential sums [pdf].
Joint work with Markus Blaser (Saarland University), Somnath Bhattacharjee (CMI), and Saswata Mukherjee (CMI).
To appear in the 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024).
Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials imply VP \ne VNP [pdf].
Joint work with Nitin Saxena (IIT Kanpur), and Thomas Thierauf (Aalen University).
Journal of Computational Complexity; 2024.
On the power of border width-2 ABPs over fields of characteristic 2 [pdf].
Joint work with Christian Ikenmeyer (University of Warwick), Balagopal Komarath (IIT Gandhinagar), Harshil Mittal (IIT Gandhinagar), Saraswati Girish Nanoti (IIT Gandhinagar), and Dhara Thakkar (IIT Gandhinagar).
In the Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024).
Fixed-parameter debordering of Waring rank [pdf].
Joint work with Fulvio Gesmundo (Saarland University), Christian Ikenmeyer (University of Warwick), Gorav Jindal (Max Planck Institute for Software Systems, Saarbrücken), and Vladimir Lysikov (Ruhr-Universität Bochum).
In the Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024).
Homogeneous algebraic complexity theory and algebraic formulas [pdf].
Joint work with Fulvio Gesmundo (Saarland University), Christian Ikenmeyer (University of Warwick), Gorav Jindal (Max Planck Institute for Software Systems, Saarbrücken), and Vladimir Lysikov (Ruhr-Universität Bochum).
In the Proceedings of the 15th Innovations in Theoretical Computer Science (ITCS 2024).
2023
On the Variants of Subset Sum: Projected and Unbounded [pdf].
Joint work with Mahesh S. Rajasree (IIT Delhi).
In the Proceedings of the 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2023).
Efficient reductions and algorithms for Subset Product [pdf].
Joint work with Mahesh S. Rajasree (IIT Kanpur).
In the Proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023).
One of the winners of the Springer Best Student Presentation Award.
An extended version [pdf] is submitted.
2022
Weak-keys and key-recovery attack for TinyJAMBU [pdf].
Joint work with Mahesh S. Rajasree (IIT Kanpur) and Santanu Sarkar (IIT Madras).
Scientific Reports - Nature (2022), Volume- 12 (16313).
A Tale of Hardness, De-randomization and De-bordering in Complexity Theory [pdf].
Ph.D. Thesis, CMI.
Advisor: Nitin Saxena (IIT Kanpur).
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits [pdf].
Joint work with Nitin Saxena (IIT Kanpur).
In the proceedings of the 63rd IEEE Symposium on Foundations of Computer Science (FOCS 2022).
On the hardness of monomial prediction and zero-sum distinguishers for Ascon [pdf].
Joint work with Mahesh S. Rajasree (IIT Kanpur) and Santanu Sarkar (IIT Madras).
In the proceedings of the 12th International Workshop on Coding and Cryptography (WCC 2022).
Algebraic algorithms for variants of Subset Sum [pdf].
Joint work with Mahesh S. Rajasree (IIT Kanpur).
In the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2022).
One of the 3 winners of the Springer Best Student Presentation Award.
2021
Demystifying the border of depth-3 algebraic circuits [pdf].
Joint work with Prateek Dwivedi (IIT Kanpur), and Nitin Saxena (IIT Kanpur).
In the proceedings of the 62nd IEEE Symposium on Foundations of Computer Science (FOCS 2021).
Invited in the SICOMP Special Issue on FOCS 2021 [Full version].
Arithmetic Circuit Complexity of Division and Truncation [pdf].
Joint work with Gorav Jindal (Institut für Mathematik,Technische Universität Berlin), Anurag Pandey (Saarland University) and Amit Sinhababu (Aalen University).
In the proceedings of the 36th Computational Complexity Conference (CCC 2021).
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits [pdf].
Joint work with Prateek Dwivedi (IIT Kanpur) and Nitin Saxena (IIT Kanpur).
In the proceedings of the 36th Computational Complexity Conference (CCC 2021).
Extended version submitted [Full version].
Real tau-Conjecture for sum-of-squares: A unified approach to lower bound and derandomization [pdf].
In the proceedings of the 16th International Computer Science Symposium in Russia (CSR 2021).
Won the Best Student Paper award and the Best Paper award.
Invited in the ToCS Special Issue on CSR'21 [Full version].
Presented in the 16th Academic Research and Careers for Students Symposium (ARCS 2022).
A Largish Sum-of-squares Implies Circuit Hardness and Derandomization [pdf].
Joint work with Nitin Saxena (IIT Kanpur), and Thomas Thierauf (Aalen University).
In the proceedings of the 12th Innovations in Theoretical Computer Science (ITCS 2021) . Subsumes earlier version 1 and version 2.
2018
Discovering the roots: Unifying and extending results on multivariate polynomial factoring in algebraic complexity [pdf].
M.Sc. Thesis, CMI 2018.
Advisors: Nitin Saxena (IIT Kanpur), Partha Mukhopadhyay (CMI).
Discovering the roots: Uniform closure results for algebraic classes under factoring [Conference version].
Joint work with Amit Sinhababu (IIT Kanpur), and Nitin Saxena (IIT Kanpur) .
In the proceedings of the 50th Annual ACM Symposium on the Theory of Computing (STOC 2018).
Extended version in J.ACM 2022 [Full version].
2017
A note on Faithful Coupling of Markov Chains [pdf].
Joint work with Debojyoti Dey (IIT Kanpur), and Professor Emeritus Somenath Biswas (IIT Kanpur), 2017.
Unpublished.
2015
Modular Inversion Hidden Number problem [pdf].
International Association for Cryptologic Research (IACR) ePrint Archive, 2015.
Unpublished.