|
Associate Professor, RM202 (Rajeev Motwani Building), Department of Computer Science and Engineering , IIT Kanpur, Kanpur 208016, India. Phone: 6210. If outside IITK, please add +91-512-(679/259/392). E-mail: rmittal @iitk .ac .in . |
|
Research
Quantum Computing, Complexity of Boolean functions, Computational Complexity.Selected articles ( Complete list )
- On the composition of randomized query complexity and approximate degree with S. Chakraborty, C. Kayal, M. Paraashar, N. Saurabh and S. Sanyal; Random 2023.
- Certificate games with S. Chakraborty, A. Gal, S. Laplante and A. Sunny; ITCS 2023.
- Tight Chang's-lemma-type bounds for Boolean functions with S. Chakraborty, N. Mande, T. Molli, M. Paraashar and S. Sanyal; FSTTCS 2021.
- Counting basic-irreducible factors mod p^k in deterministic poly-time and p-adic applications with A. Dwivedi and N. Saxena; CCC 2019.
- Characterization of binary constraint system games with R. Cleve; ICALP 2014 and QIP 2014.
- Quantum query complexity of state conversion with T. Lee, B. Reichardt, R. Spalek and M. Szegedy; FOCS 2011 and QIP 2012.
- Product rules in semidefinite programming with M. Szegedy; FCT 2007.
Teaching
- Topics in linear programming
- Old courses
- Guide to e-Lectures
- Hindi videos for introduction to programming
Misc