Author Info
Name
Affiliation
Papers
RAHUL SANTHANAM
Univ Edinburgh, Lab Fdn Comp Sci, Edinburgh, Midlothian, Scotland
8
Collaborators
Citations 
PageRank 
8
2
2.76
Referers 
Referees 
References 
4
46
27
Title
Citations
PageRank
Year
Parity helps to compute Majority.00.342019
Pseudo-derandomizing learning and approximation.00.342018
Hardness magnification near state-of-the-art lower bounds.00.342018
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits.00.342018
An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0.00.342018
Proof Complexity (Dagstuhl Seminar 18051).00.342018
Majority is Incompressible by AC^0[p] Circuits.20.392015
Majority is incompressible by AC0[p] circuits.00.342014