default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRahul Santhanam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j18]Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams:
Constructive Separations and Their Consequences. TheoretiCS 3 (2024)- [c67]Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam
:
From Proof Complexity to Circuit Complexity via Interactive Protocols. ICALP 2024: 12:1-12:20 - [c66]Zhenjian Lu, Rahul Santhanam:
Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity. ICALP 2024: 110:1-110:17 - [e2]Rahul Santhanam:
39th Computational Complexity Conference, CCC 2024, July 22-25, 2024, Ann Arbor, MI, USA. LIPIcs 300, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-331-7 [contents] - [i68]Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam:
From Proof Complexity to Circuit Complexity via Interactive Protocols. CoRR abs/2405.02232 (2024) - [i67]Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
On the Complexity of Avoiding Heavy Elements. Electron. Colloquium Comput. Complex. TR24 (2024) - [i66]Zhenjian Lu, Rahul Santhanam:
Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c65]Rahul Santhanam:
An Algorithmic Approach to Uniform Lower Bounds. CCC 2023: 35:1-35:26 - [c64]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. FOCS 2023: 1261-1270 - [p1]Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam:
Pebbles and Branching Programs for Tree Evaluation. Logic, Automata, and Computational Complexity 2023: 261-318 - [i65]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. CoRR abs/2305.15140 (2023) - [i64]Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, Manaswi Paraashar:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). Dagstuhl Reports 13(3): 17-31 (2023) - [i63]Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i62]Ján Pich, Rahul Santhanam:
Towards P $\neq$ NP from Extended Frege Lower Bounds. Electron. Colloquium Comput. Complex. TR23 (2023) - [i61]Rahul Santhanam:
An Algorithmic Approach to Uniform Lower Bounds. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j17]Igor C. Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. Comput. Complex. 31(1): 4 (2022) - [j16]Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. J. ACM 69(4): 25:1-25:49 (2022) - [c63]Michael E. Saks, Rahul Santhanam:
On Randomized Reductions to the Random Strings. CCC 2022: 29:1-29:30 - [c62]Hanlin Ren, Rahul Santhanam, Zhikun Wang:
On the Range Avoidance Problem for Circuits. FOCS 2022: 640-650 - [c61]Rahul Santhanam:
Why MCSP Is a More Important Problem Than SAT (Invited Talk). FSTTCS 2022: 2:1-2:1 - [c60]Ján Pich, Rahul Santhanam:
Learning Algorithms Versus Automatability of Frege Systems. ICALP 2022: 101:1-101:20 - [c59]Shuichi Hirahara, Rahul Santhanam:
Errorless Versus Error-Prone Average-Case Complexity. ITCS 2022: 84:1-84:23 - [c58]Shuichi Hirahara, Rahul Santhanam:
Excluding PH Pessiland. ITCS 2022: 85:1-85:25 - [c57]Hanlin Ren, Rahul Santhanam:
A Relativization Perspective on Meta-Complexity. STACS 2022: 54:1-54:13 - [c56]Rahul Ilango, Hanlin Ren, Rahul Santhanam:
Robustness of average-case meta-complexity via pseudorandomness. STOC 2022: 1575-1583 - [i60]Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams:
Constructive Separations and Their Consequences. CoRR abs/2203.14379 (2022) - [i59]Hanlin Ren, Rahul Santhanam, Zhikun Wang:
On the Range Avoidance Problem for Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - [i58]Michael E. Saks, Rahul Santhanam:
On Randomized Reductions to the Random Strings. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j15]Igor C. Oliveira, Ján Pich, Rahul Santhanam:
Hardness Magnification Near State-of-the-Art Lower Bounds. Theory Comput. 17: 1-38 (2021) - [c55]Ninad Rajgopal, Rahul Santhanam:
On the Structure of Learnability Beyond P/Poly. APPROX-RANDOM 2021: 46:1-46:23 - [c54]Hanlin Ren, Rahul Santhanam:
Hardness of KT Characterizes Parallel Cryptography. CCC 2021: 35:1-35:58 - [c53]Shafi Goldwasser, Russell Impagliazzo, Toniann Pitassi, Rahul Santhanam:
On the Pseudo-Deterministic Query Complexity of NP Search Problems. CCC 2021: 36:1-36:22 - [c52]Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams:
Constructive Separations and Their Consequences. FOCS 2021: 646-657 - [c51]Ján Pich, Rahul Santhanam:
Strong co-nondeterministic lower bounds for NP cannot be proved feasibly. STOC 2021: 223-233 - [c50]Rahul Santhanam, Iddo Tzameret:
Iterated lower bound formulas: a diagonalization-based approach to proof complexity. STOC 2021: 234-247 - [c49]Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic algorithms and the structure of probabilistic time. STOC 2021: 303-316 - [e1]Rahul Santhanam, Daniil Musatov:
Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings. Lecture Notes in Computer Science 12730, Springer 2021, ISBN 978-3-030-79415-6 [contents] - [i57]Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. CoRR abs/2103.08539 (2021) - [i56]Ján Pich, Rahul Santhanam:
Learning algorithms versus automatability of Frege systems. CoRR abs/2111.10626 (2021) - [i55]Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121). Dagstuhl Reports 11(2): 1-16 (2021) - [i54]Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams:
Constructive Separations and Their Consequences. Electron. Colloquium Comput. Complex. TR21 (2021) - [i53]Rahul Ilango, Hanlin Ren, Rahul Santhanam:
Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i52]Zhenjian Lu, Igor Carboni Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. Electron. Colloquium Comput. Complex. TR21 (2021) - [i51]Ninad Rajgopal, Rahul Santhanam:
On the Structure of Learnability beyond P/poly. Electron. Colloquium Comput. Complex. TR21 (2021) - [i50]Hanlin Ren, Rahul Santhanam:
Hardness of KT Characterizes Parallel Cryptography. Electron. Colloquium Comput. Complex. TR21 (2021) - [i49]Hanlin Ren, Rahul Santhanam:
A Relativization Perspective on Meta-Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i48]Rahul Santhanam, Iddo Tzameret:
Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i47]Hanlin Ren, Rahul Santhanam:
Hardness of KT Characterizes Parallel Cryptography. IACR Cryptol. ePrint Arch. 2021: 1076 (2021) - 2020
- [c48]Michael E. Saks, Rahul Santhanam:
Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions. CCC 2020: 26:1-26:13 - [c47]Rahul Santhanam:
Pseudorandomness and the Minimum Circuit Size Problem. ITCS 2020: 68:1-68:26 - [c46]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. ITCS 2020: 70:1-70:48
2010 – 2019
- 2019
- [c45]Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan:
Parity Helps to Compute Majority. CCC 2019: 23:1-23:17 - [c44]Igor Carboni Oliveira, Ján Pich, Rahul Santhanam:
Hardness Magnification near State-Of-The-Art Lower Bounds. CCC 2019: 27:1-27:29 - [c43]Ján Pich, Rahul Santhanam:
Why are Proof Complexity Lower Bounds Hard? FOCS 2019: 1305-1324 - [c42]Igor Carboni Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. ITCS 2019: 18:1-18:14 - [i46]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. CoRR abs/1911.08297 (2019) - [i45]Anna Gál, Rahul Santhanam, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121). Dagstuhl Reports 9(3): 64-82 (2019) - [i44]Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. Electron. Colloquium Comput. Complex. TR19 (2019) - [i43]Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan:
Parity helps to compute Majority. Electron. Colloquium Comput. Complex. TR19 (2019) - [i42]Rahul Santhanam:
Pseudorandomness and the Minimum Circuit Size Problem. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j14]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Theory Comput. 14(1): 1-55 (2018) - [c41]Igor Carboni Oliveira, Rahul Santhanam:
Pseudo-Derandomizing Learning and Approximation. APPROX-RANDOM 2018: 55:1-55:19 - [c40]Shuichi Hirahara, Igor C. Oliveira, Rahul Santhanam:
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits. CCC 2018: 5:1-5:31 - [c39]Igor Carboni Oliveira, Rahul Santhanam:
Hardness Magnification for Natural Problems. FOCS 2018: 65-76 - [c38]Ruiwen Chen, Igor C. Oliveira, Rahul Santhanam:
An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0. LATIN 2018: 317-330 - [c37]Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan:
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. MFCS 2018: 78:1-78:15 - [i41]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CoRR abs/1806.06290 (2018) - [i40]Albert Atserias, Jakob Nordström, Pavel Pudlák, Rahul Santhanam:
Proof Complexity (Dagstuhl Seminar 18051). Dagstuhl Reports 8(1): 124-157 (2018) - [i39]Shuichi Hirahara, Igor Carboni Oliveira, Rahul Santhanam:
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i38]Igor Carboni Oliveira, Ján Pich, Rahul Santhanam:
Hardness magnification near state-of-the-art lower bounds. Electron. Colloquium Comput. Complex. TR18 (2018) - [i37]Igor Carboni Oliveira, Rahul Santhanam:
Pseudo-derandomizing learning and approximation. Electron. Colloquium Comput. Complex. TR18 (2018) - [i36]Igor Carboni Oliveira, Rahul Santhanam:
Hardness Magnification for Natural Problems. Electron. Colloquium Comput. Complex. TR18 (2018) - [i35]Igor Carboni Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j13]Lance Fortnow, Rahul Santhanam:
Robust simulations and significant separations. Inf. Comput. 256: 149-159 (2017) - [c36]Shuichi Hirahara, Rahul Santhanam:
On the Average-Case Complexity of MCSP and Its Variants. CCC 2017: 7:1-7:20 - [c35]Igor C. Oliveira, Rahul Santhanam:
Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness. CCC 2017: 18:1-18:49 - [c34]Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic constructions in subexponential time. STOC 2017: 665-677 - [i34]Igor Carboni Oliveira, Ruiwen Chen, Rahul Santhanam:
An Average-Case Lower Bound against ACC^0. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j12]Andrew McGregor, Rahul Santhanam:
Special Section on the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012). SIAM J. Comput. 45(4): 1448-1449 (2016) - [c33]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CCC 2016: 1:1-1:35 - [c32]Lance Fortnow, Rahul Santhanam:
New Non-Uniform Lower Bounds for Uniform Classes. CCC 2016: 19:1-19:14 - [c31]Andrew Drucker, Jesper Nederlof, Rahul Santhanam:
Exponential Time Paradigms Through the Polynomial Time Lens. ESA 2016: 36:1-36:14 - [c30]Ruiwen Chen, Rahul Santhanam:
Satisfiability on Mixed Instances. ITCS 2016: 393-402 - [i33]Igor C. Oliveira, Rahul Santhanam:
Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness. CoRR abs/1611.01190 (2016) - [i32]Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic Constructions in Subexponential Time. CoRR abs/1612.01817 (2016) - [i31]Igor Carboni Oliveira, Rahul Santhanam:
Pseudodeterministic Constructions in Subexponential Time. Electron. Colloquium Comput. Complex. TR16 (2016) - [i30]Igor Carboni Oliveira, Rahul Santhanam:
Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j11]Yuval Filmus, Toniann Pitassi, Rahul Santhanam:
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. ACM Trans. Comput. Theory 7(2): 5:1-5:16 (2015) - [c29]Igor Carboni Oliveira, Rahul Santhanam:
Majority is Incompressible by AC^0[p] Circuits. CCC 2015: 124-157 - [c28]Ruiwen Chen, Rahul Santhanam:
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. SAT 2015: 33-45 - [c27]Rahul Santhanam, Richard Ryan Williams:
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity. SODA 2015: 231-241 - [i29]Ruiwen Chen, Rahul Santhanam:
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. Electron. Colloquium Comput. Complex. TR15 (2015) - [i28]Ruiwen Chen, Rahul Santhanam:
Satisfiability on Mixed Instances. Electron. Colloquium Comput. Complex. TR15 (2015) - [i27]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j10]Rahul Santhanam, Ryan Williams:
On Uniformity and Circuit Lower Bounds. Comput. Complex. 23(2): 177-205 (2014) - [i26]Olaf Beyersdorff, Edward A. Hirsch, Jan Krajícek, Rahul Santhanam:
Optimal algorithms and proofs (Dagstuhl Seminar 14421). Dagstuhl Reports 4(10): 51-68 (2014) - [i25]Lance Fortnow, Rahul Santhanam:
Hierarchies Against Sublinear Advice. Electron. Colloquium Comput. Complex. TR14 (2014) - [i24]Igor Carboni Oliveira, Rahul Santhanam:
Majority is incompressible by AC0[p] circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j9]Maurice J. Jansen, Rahul Santhanam:
Permanent does not have succinct polynomial size arithmetic circuits of constant depth. Inf. Comput. 222: 195-207 (2013) - [c26]Rahul Santhanam, Ryan Williams:
On Medium-Uniformity and Circuit Lower Bounds. CCC 2013: 15-23 - [i23]Rahul Santhanam, Ryan Williams:
New Algorithms for QBF Satisfiability and Implications for Circuit Complexity. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j8]Rahul Santhanam:
Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds. Bull. EATCS 106: 31-52 (2012) - [j7]Rahul Santhanam:
The Complexity of Explicit Constructions. Theory Comput. Syst. 51(3): 297-312 (2012) - [j6]Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam:
Pebbles and Branching Programs for Tree Evaluation. ACM Trans. Comput. Theory 3(2): 4:1-4:43 (2012) - [c25]Arkadev Chattopadhyay, Rahul Santhanam:
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits. FOCS 2012: 619-628 - [c24]Rahul Santhanam, Srikanth Srinivasan:
On the Limits of Sparsification. ICALP (1) 2012: 774-785 - [c23]Maurice J. Jansen, Rahul Santhanam:
Marginal hitting sets imply super-polynomial lower bounds for permanent. ITCS 2012: 496-506 - [c22]Chiranjit Chakraborty, Rahul Santhanam:
Instance Compression for the Polynomial Hierarchy and beyond. IPEC 2012: 120-134 - [c21]Maurice J. Jansen, Rahul Santhanam:
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. STACS 2012: 519-530 - [i22]Subramanian Ramamoorthy, András Z. Salamon, Rahul Santhanam:
Macroscopes: models for collective decision making. CoRR abs/1204.3860 (2012) - [i21]Chiranjit Chakraborty, Rahul Santhanam:
Instance Compression for the Polynomial Hierarchy and Beyond. Electron. Colloquium Comput. Complex. TR12 (2012) - [i20]Arkadev Chattopadhyay, Rahul Santhanam:
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits. Electron. Colloquium Comput. Complex. TR12 (2012) - [i19]Rahul Santhanam:
Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR12 (2012) - [i18]Rahul Santhanam, Ryan Williams:
Uniform Circuits, Lower Bounds, and QBF Algorithms. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j5]Lance Fortnow, Rahul Santhanam:
Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1): 91-106 (2011) - [c20]Lance Fortnow, Rahul Santhanam:
Robust Simulations and Significant Separations. ICALP (1) 2011: 569-580 - [c19]Yuval Filmus, Toniann Pitassi, Rahul Santhanam:
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. ICALP (1) 2011: 618-629 - [c18]Maurice J. Jansen, Rahul Santhanam:
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth. ICALP (1) 2011: 724-735 - [i17]Maurice J. Jansen, Rahul Santhanam:
Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent. Electron. Colloquium Comput. Complex. TR11 (2011) - [i16]Maurice J. Jansen, Rahul Santhanam:
Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes. Electron. Colloquium Comput. Complex. TR11 (2011) - [i15]Rahul Santhanam, Srikanth Srinivasan:
On the Limits of Sparsification. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c17]Rahul Santhanam:
The Complexity of Explicit Constructions. CiE 2010: 372-375 - [c16]Rahul Santhanam:
Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability. FOCS 2010: 183-192 - [c15]Lance Fortnow, Rahul Santhanam:
Bounding Rationality by Discounting Time. ICS 2010: 143-155 - [c14]Toniann Pitassi, Rahul Santhanam:
Effectively Polynomial Simulations. ICS 2010: 370-382 - [i14]Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam:
Pebbles and Branching Programs for Tree Evaluation. CoRR abs/1005.2642 (2010) - [i13]Lance Fortnow, Rahul Santhanam:
Robust Simulations and Significant Separations. CoRR abs/1012.2034 (2010)
2000 – 2009
- 2009
- [j4]Rahul Santhanam:
Circuit Lower Bounds for Merlin--Arthur Classes. SIAM J. Comput. 39(3): 1038-1061 (2009) - [c13]Lance Fortnow, Rahul Santhanam, Ryan Williams:
Fixed-Polynomial Size Circuit Bounds. CCC 2009: 19-26 - [c12]Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr:
Fractional Pebbling and Thrifty Branching Programs. FSTTCS 2009: 109-120 - [c11]Harry Buhrman, Lance Fortnow, Rahul Santhanam:
Unconditional Lower Bounds against Advice. ICALP (1) 2009: 195-209 - [c10]Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr:
Branching Programs for Tree Evaluation. MFCS 2009: 175-186 - [i12]Harry Buhrman, Lance Fortnow, Rahul Santhanam:
Unconditional Lower Bounds against Advice. Algebraic Methods in Computational Complexity 2009 - [i11]Lance Fortnow, Rahul Santhanam:
Bounding Rationality by Discounting Time. CoRR abs/0911.3162 (2009) - [i10]Harry Buhrman, Lance Fortnow, Rahul Santhanam:
Unconditional Lower Bounds against Advice. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c9]Lance Fortnow, Rahul Santhanam:
Infeasibility of instance compression and succinct PCPs for NP. STOC 2008: 133-142 - 2007
- [c8]Rahul Santhanam:
Circuit lower bounds for Merlin-Arthur classes. STOC 2007: 275-283 - [i9]Lance Fortnow, Rahul Santhanam:
Time Hierarchies: A Survey. Electron. Colloquium Comput. Complex. TR07 (2007) - [i8]Lance Fortnow, Rahul Santhanam:
Infeasibility of Instance Compression and Succinct PCPs for NP. Electron. Colloquium Comput. Complex. TR07 (2007) - [i7]Rahul Santhanam:
Circuit Lower Bounds for Merlin-Arthur Classes. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j3]Rahul Santhanam, Kamala Krithivasan:
Graph splicing systems. Discret. Appl. Math. 154(8): 1264-1278 (2006) - [c7]Joshua Buresh-Oppenheim, Rahul Santhanam:
Making Hard Problems Harder. CCC 2006: 73-87 - [c6]Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran:
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199 - [c5]Ivona Bezáková, Adam Kalai, Rahul Santhanam:
Graph model selection using maximum likelihood. ICML 2006: 105-112 - [i6]Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam:
Uniform Hardness Amplification in NP via Monotone Codes. Electron. Colloquium Comput. Complex. TR06 (2006) - [i5]Joshua Buresh-Oppenheim, Rahul Santhanam:
Making Hard Problems Harder. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Lance Fortnow, Rahul Santhanam:
Fixed-Polynomial Size Circuit Bounds. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j2]Dieter van Melkebeek, Rahul Santhanam:
Holographic Proofs and Derandmization. SIAM J. Comput. 35(1): 59-90 (2005) - [c4]Lance Fortnow, Rahul Santhanam, Luca Trevisan:
Hierarchies for semantic classes. STOC 2005: 348-355 - 2004
- [c3]Lance Fortnow, Rahul Santhanam:
Hierarchy Theorems for Probabilistic Polynomial Time. FOCS 2004: 316-324 - [i3]Lance Fortnow, Rahul Santhanam, Luca Trevisan:
Promise Hierarchies. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c2]Rahul Santhanam, Dieter van Melkebeek:
Holographic Proofs and Derandomization. CCC 2003: 269-283 - 2002
- [i2]Rahul Santhanam:
Resource Tradeoffs and Derandomization. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j1]Rahul Santhanam:
Lower bounds on the complexity of recognizing SAT by Turing machines. Inf. Process. Lett. 79(5): 243-247 (2001) - [c1]Rahul Santhanam:
On Separators, Segregators and Time versus Space. CCC 2001: 286-294 - [i1]Rahul Santhanam:
On segregators, separators and time versus space. Electron. Colloquium Comput. Complex. TR01 (2001)
Coauthor Index
Igor C. Oliveira
aka: Igor Carboni Oliveira
aka: Igor Carboni Oliveira
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
