Rahul Santhanam, Ph.D.
Affiliations: | 2005 | University of Chicago, Chicago, IL |
Area:
Computer ScienceGoogle:
"Rahul Santhanam"Parents
Sign in to add mentor| Lance Fortnow | grad student | 2005 | Chicago | |
| (Hierarchy theorems and resource tradeoffs for semantic classes.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Hirahara S, Oliveira IC, Santhanam R. (2018) NP-hardness of minimum circuit size problem for OR-AND-MOD circuits Electronic Colloquium On Computational Complexity. 102: 31 |
| Fortnow L, Santhanam R. (2016) New non-uniform lower bounds for uniform classes Leibniz International Proceedings in Informatics, Lipics. 50: 19:1-19:14 |
| Santhanam R, Williams R. (2015) Beating exhaustive search for quantified Boolean formulas and connections to circuit complexity Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2015: 231-241 |
| Santhanam R, Williams R. (2014) On Uniformity and Circuit Lower Bounds Computational Complexity. 23: 177-205 |
| Santhanam R, Williams R. (2013) On medium-uniformity and circuit lower bounds Proceedings of the Annual Ieee Conference On Computational Complexity. 15-23 |
| Jansen M, Santhanam R. (2013) Permanent does not have succinct polynomial size arithmetic circuits of constant depth Information and Computation. 222: 195-207 |
| Allender E, Arvind V, Santhanam R, et al. (2012) Uniform derandomization from pathetic lower bounds. Philosophical Transactions. Series a, Mathematical, Physical, and Engineering Sciences. 370: 3512-35 |
| Jansen M, Santhanam R. (2012) Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes Leibniz International Proceedings in Informatics, Lipics. 14: 519-530 |
| Jansen M, Santhanam R. (2012) Marginal hitting sets imply super-polynomial lower bounds for permanent Itcs 2012 - Innovations in Theoretical Computer Science Conference. 496-506 |
| Cook S, McKenzie P, Wehr D, et al. (2012) Pebbles and branching programs for tree evaluation Acm Transactions On Computation Theory. 3 |