[dblp]
Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett
Exponential Lower Bounds on the Size of ResLin Proofs of Nearly Quadratic Depth (STOC 2026) [arXiv, eccc]
Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay
Note: This paper was merged with Lower Bounds for Bit Pigeonhole Principles in Bounded-Depth Resolution over Parities by Farzan Byramji and Russell Impagliazzo in STOC proceedings. Title of the merged paper is Lower Bounds for Near-Quadratic-Depth Resolution over Parities.
Aaronson-Ambainis Conjecture Is True For Random Restrictions (ITCS 2025, best student paper) [arXiv, eccc]
Sreejata Kishor Bhattacharya
Title of conference version: Random Restrictions of Bounded Low Degree Polynomials are Juntas
Exponential Separation Between Powers of Regular and General Resolution Over Parities (CCC 2024) [arXiv, eccc]
Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvořák