Name: Suhail Sherif
Status: Writing my PhD thesis at the School of Technology and Computer Science, TIFR, Mumbai under the guidance of Arkadev Chattopadhyay
Also on the lookout for postdoctoral positions.
Contact: <fullname>@gmail.com
Interests: Computational complexity, specifically query and communication complexity. Budding interest in quantum query complexity.
Publications:
Tired of having ECCC reports download to your downloads folder instead of opening in the browser? Check out ECCC Fixes, available on both Firefox and Chrome.
Interests: Computational complexity, specifically query and communication complexity. Budding interest in quantum query complexity.
Publications:
- The Log-Approximate-Rank Conjecture is False, with Arkadev Chattopadhyay and Nikhil Mande. Presented in a plenary talk at STOC 2019 [Slides, Video not yet out]. Also published in JACM.
- Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture, with Arkadev Chattopadhyay and Ankit Garg.
- No quantum speedup over gradient descent for non-smooth convex optimization, with Ankit Garg, Robin Kothari and Praneeth Netrapalli. To appear in ITCS 2021 [Video] and QIP 2021.
Tired of having ECCC reports download to your downloads folder instead of opening in the browser? Check out ECCC Fixes, available on both Firefox and Chrome.
