Rahul Santhanam - Concepedia

Author

Rahul Santhanam

University of Oxford ORCID

Also Known As

Mahajan, Meena, R. Santhanam, Rahul Santhanam, Santhanam, Rahul

132

Publications

1.3K

Citations

H-Index

Concepts

All Affiliations

University of Oxford Simon Fraser University University of Edinburgh University of Toronto University of Chicago

About

Rahul Santhanam is an author at University of Oxford specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	16	21	887
2	Business	1	1	38
3	Language Studies	1	1	26
4	Natural Sciences	1	1	36
5	Computer Engineering	1	1	34

Rahul Santhanam

Publications

Citations

H-Index

Page 1

	Year	Citations
Infeasibility of instance compression and succinct PCPs for NP Lance Fortnow, Rahul Santhanam Journal of Computer and System Sciences EngineeringInstance CompressionComputational ComplexityP Versus Np ProblemComputer Science	2010	281
Infeasibility of instance compression and succinct PCPs for NP Lance Fortnow, Rahul Santhanam Mathematical ProgrammingComputational Complexity TheoryEngineeringComputational ComplexityOr-sat Problem	2008	88
Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability Rahul Santhanam Computational Complexity TheoryEngineeringVerificationAutomated ProofComputational Complexity	2010	70
Hierarchy Theorems for Probabilistic Polynomial Time Lance Fortnow, Rahul Santhanam Mathematical ProgrammingComputational Complexity TheoryEngineeringComputational ComplexityProbabilistic Computation	2004	50
Circuit Lower Bounds for Merlin–Arthur Classes Rahul Santhanam SIAM Journal on Computing Circuit ComplexityTheory Of ComputingComputational Complexity TheoryEngineeringAlgebraic Complexity	2009	41
Graph model selection using maximum likelihood Ivona Bezáková, Adam Tauman Kalai, Rahul Santhanam Network ScienceGraph TheoryData ScienceEngineeringRandom Graph	2006	38
Hardness Magnification for Natural Problems Igor Carboni Oliveira, Rahul Santhanam Mathematical ProgrammingCircuit ComplexityComputational Complexity TheoryEngineeringComputational Complexity	2018	36
Circuit lower bounds for Merlin-Arthur classes Rahul Santhanam Circuit ComplexityTheory Of ComputingEngineeringJournal Citation ReportData Science	2007	35
Innovations in Computer Science - ICS 2010 Lance Fortnow, Rahul Santhanam EngineeringElectronic Design AutomationComputer DesignComputer EngineeringComputer Architecture	2010	34
Hierarchies for semantic classes Lance Fortnow, Rahul Santhanam, Luca Trevisan EngineeringNtime ∩ ContimeComputational ComplexitySemanticsSemantic Web	2005	26

Page 1