Rajat Mittal
Rajat Mittal
Verified email at iitk.ac.in - Homepage
Cited by
Cited by
Quantum query complexity of state conversion
T Lee, R Mittal, BW Reichardt, R Špalek, M Szegedy
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 344-353, 2011
Characterization of binary constraint system games
R Cleve, R Mittal
International Colloquium on Automata, Languages, and Programming, 320-331, 2014
Product rules in semidefinite programming
R Mittal, M Szegedy
International Symposium on Fundamentals of Computation Theory, 435-445, 2007
Extended non-local games and monogamy-of-entanglement games
N Johnston, R Mittal, V Russo, J Watrous
Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2016
An adversary for algorithms
T Lee, R Mittal, BW Reichardt, R Špalek
arXiv preprint arXiv:1011.3020, 2010
Counting basic-irreducible factors mod in deterministic poly-time and -adic applications
A Dwivedi, R Mittal, N Saxena
arXiv preprint arXiv:1902.07785, 2019
Efficiently factoring polynomials modulo
A Dwivedi, R Mittal, N Saxena
arXiv preprint arXiv:1901.06628, 2019
Product theorems via semidefinite programming
T Lee, R Mittal
International Colloquium on Automata, Languages, and Programming, 674-685, 2008
Tight Chang's-lemma-type bounds for Boolean functions
S Chakraborty, NS Mande, R Mittal, T Molli, M Paraashar, S Sanyal
arXiv preprint arXiv:2012.02335, 2020
Irreducibility and deterministic r-th root finding over finite fields
V Bhargava, G Ivanyos, R Mittal, N Saxena
Proceedings of the 2017 ACM on International Symposium on Symbolic and …, 2017
Stabilizer codes from modified symplectic form
T Gandhi, P Kurur, R Mittal
arXiv preprint arXiv:1708.00617, 2017
Lower bounds on quantum query complexity for symmetric functions
R Mittal, SS Nair, S Patro
arXiv preprint arXiv:2110.12616, 2021
On Algorithms to Find p-ordering
A Gulati, S Chakrabarti, R Mittal
Conference on Algorithms and Discrete Applied Mathematics, 333-345, 2021
Efficiently factoring polynomials modulo p⁴
A Dwivedi, R Mittal, N Saxena
Association for Computing Machinery, 2019
Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant
M Forbes, N Kayal, R Mittal, C Saha
arXiv preprint arXiv:1104.4557, 2011
Application of SDP to product rules and quantum query complexity
R Mittal
Rutgers The State University of New Jersey-New Brunswick, 2011
Internship Report–NEC 2008
R Mittal
Lecture 16: Strong duality
R Mittal
Lecture 2: Proofs
R Mittal
Lecture 17: Approximation algorithm for max-cut
R Mittal
The system can't perform the operation now. Try again later.
Articles 1–20