Rajat Mittal

J. Symb. Comput., 2021

2019

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Efficiently factoring polynomials modulo $p^4$.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Efficiently factoring polynomials modulo p4.

[BibT_eX]

[DOI]

CoRR, 2019

Efficiently Factoring Polynomials Modulo p4.

[BibT_eX]

[DOI]

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

Stabilizer codes from modified symplectic forms.

[BibT_eX]

[DOI]

Tejas Gandhi

Piyush Kurur

Proceedings of the IEEE International Symposium on Information Theory, 2019

2017

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Stabilizer codes from modified symplectic form.

[BibT_eX]

[DOI]

Tejas Gandhi

Piyush Kurur

CoRR, 2017

Irreducibility and r-th root finding over finite fields.

[BibT_eX]

[DOI]

CoRR, 2017

2014

Characterization of Binary Constraint System Games.

[BibT_eX]

[DOI]

Richard Cleve

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

[BibT_eX]

[DOI]

CoRR, 2011

Quantum Query Complexity of State Conversion.

[BibT_eX]

[DOI]

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

2008

Product Theorems Via Semidefinite Programming.

[BibT_eX]

[DOI]

Troy Lee

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

2007

Product Rules in Semidefinite Programming.

[BibT_eX]

[DOI]