Statistics
Publications
30
Citations
1K
H-Index
17
Active since
2004
Rahul Santhanam is an author at University of Oxford specializing in computer science, computing, and mathematics.
Publications per year
2004–2022
30
30
Infeasibility of instance compression and succinct PCPs for NP
Lance Fortnow, Rahul Santhanam · 2008 · 88 citations
Hierarchy Theorems for Probabilistic Polynomial Time
Lance Fortnow, Rahul Santhanam · 2004 · 51 citations
Circuit Lower Bounds for Merlin–Arthur Classes
Rahul Santhanam · SIAM Journal on Computing · 2009 · 41 citations
1–5 of 30