Scholar
Ramprasad Saptharishi
Google Scholar ID: Sy-zJGIAAAAJ
Tata Institute of Fundamental Research
computational complexity
arithmetic circuits
pseudorandomness
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
681
H-index
14
i10-index
18
Publications
20
Co-authors
5
list available
Publications
7 items
Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps
2026
Cited
0
Hitting Sets for Polynomials with Small Partial Derivative Spaces
2026
Cited
0
Constant-depth circuits for polynomial GCD over any characteristic
2025
Cited
0
Closure under factorization from a result of Furstenberg
2025
Cited
0
Deterministic factorization of constant-depth algebraic circuits in subexponential time
2025
Cited
0
An exposition of recent list-size bounds of FRS Codes
2025
Cited
0
On the Existence of Algebraic Natural Proofs
2020
Cited
6
Co-authors
3 total
Nitin Saxena
N.Rama.Rao.Professor & J.C.Bose.Fellow, CSE, IIT Kanpur; FNA FASc FNASc FNAE
Anindya De
University of Pennsylvania
Girish Varma
IIIT, Hyderabad
