Rajat Mittal

According to our database, Rajat Mittal authored at least 22 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Relations between monotone complexity measures based on decision tree complexity.

Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal

Electron. Colloquium Comput. Complex., 2024

On Query Complexity Measures and Their Relations for Symmetric Functions.

Rajat Mittal, Sanjay S. Nair, Sunayana Patro

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

Approximate Degree Composition for Recursive Functions.

Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh

Proceedings of the Approximation, 2024

2023

On the Composition of Randomized Query Complexity and Approximate Degree.

Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh

Electron. Colloquium Comput. Complex., 2023

2022

Certificate games.

Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny

Electron. Colloquium Comput. Complex., 2022

2021

Efficiently factoring polynomials modulo <i>p</i>⁴.

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

J. Symb. Comput., 2021

Lower bounds on quantum query complexity for symmetric functions.

Rajat Mittal, Sanjay S. Nair, Sunayana Patro

CoRR, 2021

Tight Chang's-Lemma-Type Bounds for Boolean Functions.

Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

On Algorithms to Find p-ordering.

Aditya Gulati, Sayak Chakrabarti, Rajat Mittal

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2019

Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications.

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

Electron. Colloquium Comput. Complex., 2019

Efficiently factoring polynomials modulo $p^4$.

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

Electron. Colloquium Comput. Complex., 2019

Efficiently factoring polynomials modulo p⁴.

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

CoRR, 2019

Efficiently Factoring Polynomials Modulo p4.

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Stabilizer codes from modified symplectic forms.

Tejas Gandhi, Piyush Kurur, Rajat Mittal

Proceedings of the IEEE International Symposium on Information Theory, 2019

2017

Irreducibility and deterministic r-th root finding over finite fields.

Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena

Electron. Colloquium Comput. Complex., 2017

Stabilizer codes from modified symplectic form.

Tejas Gandhi, Piyush Kurur, Rajat Mittal

CoRR, 2017

Irreducibility and r-th root finding over finite fields.

Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena

CoRR, 2017

2014

Characterization of Binary Constraint System Games.

Richard Cleve, Rajat Mittal

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2011

Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant

Michael Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha

CoRR, 2011

Quantum Query Complexity of State Conversion.

Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2008

Product Theorems Via Semidefinite Programming.

Troy Lee, Rajat Mittal

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Product Rules in Semidefinite Programming.

Rajat Mittal, Mario Szegedy

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007