| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam |
Pebbles and Branching Programs for Tree Evaluation.  |
TOCT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Subramanian Ramamoorthy, András Z. Salamon, Rahul Santhanam |
Macroscopes: models for collective decision making |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Maurice J. Jansen, Rahul Santhanam |
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, Rahul Santhanam |
Marginal hitting sets imply super-polynomial lower bounds for permanent. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, Rahul Santhanam |
Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rahul Santhanam, Srikanth Srinivasan |
On the Limits of Sparsification. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Maurice J. Jansen, Rahul Santhanam |
Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Infeasibility of instance compression and succinct PCPs for NP. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Filmus, Toniann Pitassi, Rahul Santhanam |
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, Rahul Santhanam |
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Robust Simulations and Significant Separations. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Robust Simulations and Significant Separations |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam |
Pebbles and Branching Programs for Tree Evaluation |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Toniann Pitassi, Rahul Santhanam |
Effectively Polynomial Simulations. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Bounding Rationality by Discounting Time. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rahul Santhanam |
Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Santhanam |
The Complexity of Explicit Constructions. |
CiE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Rahul Santhanam |
Unconditional Lower Bounds against Advice. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Bounding Rationality by Discounting Time |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Rahul Santhanam |
Circuit Lower Bounds for Merlin--Arthur Classes. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Rahul Santhanam |
Unconditional Lower Bounds against Advice. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
Branching Programs for Tree Evaluation. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam, Ryan Williams |
Fixed-Polynomial Size Circuit Bounds. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
Fractional Pebbling and Thrifty Branching Programs. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Infeasibility of instance compression and succinct PCPs for NP. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
instance compression, succinct PCPs, cryptography, parameterized complexity, polynomial hierarchy |
| 1 | Lance Fortnow, Rahul Santhanam |
Time Hierarchies: A Survey. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Infeasibility of Instance Compression and Succinct PCPs for NP. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rahul Santhanam |
Circuit Lower Bounds for Merlin-Arthur Classes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rahul Santhanam |
Circuit lower bounds for Merlin-Arthur classes. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Merlin-Arthur games, average-case lower bounds, circuit lower bounds, advice, pseudo-random generators |
| 1 | Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam |
Uniform Hardness Amplification in NP via Monotone Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Joshua Buresh-Oppenheim, Rahul Santhanam |
Making Hard Problems Harder |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Fixed-Polynomial Size Circuit Bounds. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rahul Santhanam, Kamala Krithivasan |
Graph splicing systems. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Adam Kalai, Rahul Santhanam |
Graph model selection using maximum likelihood. |
ICML |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Buresh-Oppenheim, Rahul Santhanam |
Making Hard Problems Harder. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran |
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter van Melkebeek, Rahul Santhanam |
Holographic Proofs and Derandmization. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam, Luca Trevisan |
Hierarchies for semantic classes. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
hierarchy theorems, semantic classes, advice |
| 1 | Lance Fortnow, Rahul Santhanam, Luca Trevisan |
Promise Hierarchies |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Rahul Santhanam |
Hierarchy Theorems for Probabilistic Polynomial Time. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Santhanam, Dieter van Melkebeek |
Holographic Proofs and Derandomization. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Santhanam |
Resource Tradeoffs and Derandomization |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Rahul Santhanam |
Lower bounds on the complexity of recognizing SAT by Turing machines. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Santhanam |
On segregators, separators and time versus space |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Rahul Santhanam |
On Separators, Segregators and Time versus Space. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")