Rajat Mittal

36 papers A* 1A 4B 4Journal 21Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Hardness Condensation for Decision Tree Measures by Restrictions.
CoRR
Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh
2024 A conf
Approximate Degree Composition for Recursive Functions.
APPROX/RANDOM
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh
2024 J jnl
Approximate Degree Composition for Recursive Functions.
CoRR
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh
2024 — conf
On Query Complexity Measures and Their Relations for Symmetric Functions.
CALDAM
Rajat Mittal, Sanjay S. Nair, Sunayana Patro
2024 — conf
Relations Between Monotone Complexity Measures Based on Decision Tree Complexity.
COCOON (1)
Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal
2024 J jnl
Relations between monotone complexity measures based on decision tree complexity.
CoRR
Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal
2024 J jnl
Relations between monotone complexity measures based on decision tree complexity.
Electron. Colloquium Comput. Complex.
Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal
2023 A conf
Certificate Games.
ITCS
Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny
2023 A conf
On the Composition of Randomized Query Complexity and Approximate Degree.
APPROX/RANDOM
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
2023 J jnl
On the Composition of Randomized Query Complexity and Approximate Degree.
CoRR
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
2023 J jnl
On the Composition of Randomized Query Complexity and Approximate Degree.
Electron. Colloquium Comput. Complex.
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
2022 J jnl
Certificate games.
CoRR
Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny
2022 J jnl
Certificate games.
Electron. Colloquium Comput. Complex.
Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny
2021 J jnl
Efficiently factoring polynomials modulo
J. Symb. Comput.
Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2021 J jnl
Lower bounds on quantum query complexity for symmetric functions.
CoRR
Rajat Mittal, Sanjay S. Nair, Sunayana Patro
2021 — conf
On Algorithms to Find p-ordering.
CALDAM
Aditya Gulati, Sayak Chakrabarti, Rajat Mittal
2021 — conf
Tight Chang's-Lemma-Type Bounds for Boolean Functions.
FSTTCS
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal
2020 J jnl
On algorithms to find p-ordering.
CoRR
Aditya Gulati, Sayak Chakrabarti, Rajat Mittal
2020 J jnl
Tight Chang's-lemma-type bounds for Boolean functions.
CoRR
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal
2019 A conf
Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications.
CCC
Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019 J jnl
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications.
CoRR
Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019 J jnl
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications.
Electron. Colloquium Comput. Complex.
Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019 B conf
Efficiently Factoring Polynomials Modulo p4.
ISSAC
Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019 J jnl
Efficiently factoring polynomials modulo $p^4$.
Electron. Colloquium Comput. Complex.
Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019 J jnl
Efficiently factoring polynomials modulo p
CoRR
Ashish Dwivedi, Rajat Mittal, Nitin Saxena
2019 B conf
Stabilizer codes from modified symplectic forms.
ISIT
Tejas Gandhi, Piyush Kurur, Rajat Mittal
2017 B conf
Irreducibility and Deterministic r-th Root Finding over Finite Fields.
ISSAC
Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
2017 J jnl
Irreducibility and deterministic r-th root finding over finite fields.
Electron. Colloquium Comput. Complex.
Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
2017 J jnl
Irreducibility and r-th root finding over finite fields.
CoRR
Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
2017 J jnl
Stabilizer codes from modified symplectic form.
CoRR
Tejas Gandhi, Piyush Kurur, Rajat Mittal
2014 — conf
Characterization of Binary Constraint System Games.
ICALP (1)
Richard Cleve, Rajat Mittal
2011 A* conf
Quantum Query Complexity of State Conversion.
FOCS
Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy
2011 J jnl
Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant
CoRR
Michael Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha
2008 — conf
Product Theorems Via Semidefinite Programming.
ICALP (1)
Troy Lee, Rajat Mittal
2008 J jnl
Product theorems via semidefinite programming
CoRR
Troy Lee, Rajat Mittal
2007 B conf
Product Rules in Semidefinite Programming.
FCT
Rajat Mittal, Mario Szegedy