Embedded Files
Welcome to my webpage!
I am a graduate student at School of Technology and Computer Science, Tata Institute of Fundamental Research working under the supervision of Arkadev Chattopadhyay. I am broadly interested in theoretical computer science. In particular, I like thinking about various aspects of complexity theory (proof complexity, communication complexity, etc) and quantum computing. I am supported by a Google PhD Fellowship.
Email: <first name> [dot] <last name> [at] tifr [dot] res [dot] in
CV: [link]
Education
Bachelors of Science at Chennai Mathematical Institute (Mathematics and Computer Science) Aug. 2016 - May 2019
Masters of Science at Chennai Mathematical Institute (Computer Science) Aug. 2019 - May 2021
PhD at School of Technology and Computer Science, Tata Institute of Fundamental Research Dec. 2021 - Present
Publications and Preprints
[dblp]
Lower Bounds for Near-Quadratic-Depth Resolution over Parities (STOC 2026, merger of [BC25] and [BI25])
Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Russell Impagliazzo
Quantum–Classical Equivalence for AND-Functions (under submission) [eccc]
Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett
Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay
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 Low Degree Bounded 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
Shot at Grand Central Terminal, New York
Page updated
Google Sites
Report abuse