Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
Research InterestsComplexity measures on Boolean functionsMoved to:Google Deepmind, Bangalore, India |
Publications (while with the group, last 10)
See here for all publications while at IITM
- Bounds for Hardness Condensation in the Query Model
Authors: Chandrima Kayal, Rajat Mittal, Soumya Nalli, Manaswi Paraashar, Karthikeya Polisetty, Jayalal Sarma, Nitin Saurabh
Proceedings of Computational Complexity Conference 2026 (CCC 2026), Vol , No., Aug 2026