Follow
Ashish Dwivedi
Ashish Dwivedi
Posdoctoral Scholar, The Ohio State
Verified email at osu.edu - Homepage
Title
Cited by
Cited by
Year
Efficiently factoring polynomials modulo p4
A Dwivedi, R Mittal, N Saxena
Journal of Symbolic Computation 104, 805-823, 2021
142021
Counting basic-irreducible factors mod p^k in deterministic poly-time and p-adic applications
A Dwivedi, R Mittal, N Saxena
34th Computational Complexity Conference (CCC 2019) 137, 15:1--15:29, 2019
122019
Computing Igusa’s local zeta function of univariates in deterministic polynomial-time
A Dwivedi, N Saxena
14th Algorithmic Number Theory Symposium, Open Book Series 4 (1), 197-214, 2020
62020
Polynomials over Composites: Compact root representation via ideals and algorithmic consequences
A Dwivedi
PhD Thesis, Indian Institute of Technology Kanpur, 2023
32023
On the Complexity of Hilbert’s Nullstellensatz over Positive Characteristic
A Dwivedi
M. Tech Thesis, Indian Institute of Technilogy, Kanpur, India, 2017
32017
Solving polynomial systems over non-fields and applications to modular polynomial factoring
S Chakrabarti, A Dwivedi, N Saxena
Preprint, 2022
12022
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
A Dwivedi, Z Guo, BL Volk
arXiv preprint arXiv:2402.11915, 2024
2024
Efficiently factoring polynomials modulo p⁴
A Dwivedi, R Mittal, N Saxena
Association for Computing Machinery, 2019
2019
CS682 Project Report Hallgren’s Efficient Quantum Algorithm for Solving Pell’s Equation
A Dwivedi
2017
ANTS XIV
A Dwivedi, N Saxena
CS682 Project Proposal: Pell’s Equation and Efficient Quantum Algorithms for Pell’s Equation and Related Problems
A Dwivedi, R Mittal
The system can't perform the operation now. Try again later.
Articles 1–11