Scholar
Rahul Santhanam
Google Scholar ID: rlMZibgAAAAJ
University of Oxford
Computational complexity theory
algorithms
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
2,236
H-index
25
i10-index
61
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
2 items
ETH-Hardness of Learning Monotone Circuits and Approximating Their Size
2026
Cited
0
AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
2025
Cited
0
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)
