Name: Suhail Sherif
Status: Writing my PhD thesis at the School of Technology and Computer Science, TIFR, Mumbai under the guidance of Arkadev Chattopadhyay
Contact: <fullname>@gmail.com
Interests: Computational complexity, specifically query and communication complexity.
Publication:
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].
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.
Status: Writing my PhD thesis at the School of Technology and Computer Science, TIFR, Mumbai under the guidance of Arkadev Chattopadhyay
Contact: <fullname>@gmail.com
Interests: Computational complexity, specifically query and communication complexity.
Publication:
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].
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.
