Rahul Santhanam

发表

30th Conference on Computational Complexity (CCC 2015)

Igor Carboni Oliveira, Rahul Santhanam, 2015 .

NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits

Igor Carboni Oliveira, Rahul Santhanam, Shuichi Hirahara, 2018, Electron. Colloquium Comput. Complex..

Special Section on the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012)

Rahul Santhanam, Andrew McGregor, 2016, SIAM J. Comput..

Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds

Rahul Santhanam, Ninad Rajgopal, Srikanth Srinivasan, 2018, MFCS.

An Average-Case Lower Bound against ACC^0

Igor Carboni Oliveira, Rahul Santhanam, Ruiwen Chen, 2017, Electron. Colloquium Comput. Complex..

On segregators, separators and time versus space

Rahul Santhanam, 2001, Electron. Colloquium Comput. Complex..

Fractional Pebbling and Thrifty Branching Programs

Mark Braverman, Rahul Santhanam, Stephen A. Cook, 2009, FSTTCS.

Pseudorandomness and the Minimum Circuit Size Problem

Rahul Santhanam, R. Santhanam, 2019, Electron. Colloquium Comput. Complex..

Holographic Proofs and Derandmization

Rahul Santhanam, Dieter van Melkebeek, 2005, SIAM J. Comput..

Stronger Lower Bounds and Randomness-Hardness Tradeoffs using Associated Algebraic Complexity Classes

Rahul Santhanam, Maurice J. Jansen, 2011, Electron. Colloquium Comput. Complex..

Effectively Polynomial Simulations

Toniann Pitassi, Rahul Santhanam, 2010, ICS.

Unconditional Lower Bounds against Advice

Lance Fortnow, Rahul Santhanam, Harry Buhrman, 2009, ICALP.

Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)

Rahul Santhanam, Anna Gál, Till Tantau, 2019, Dagstuhl Reports.

The Complexity of Explicit Constructions

Rahul Santhanam, 2010, CiE.

Hardness magnification near state-of-the-art lower bounds

Igor Carboni Oliveira, Rahul Santhanam, Ján Pich, 2019, Electron. Colloquium Comput. Complex..

On Medium-Uniformity and Circuit Lower Bounds

Rahul Santhanam, Ryan Williams, 2013, 2013 IEEE Conference on Computational Complexity.

Why are Proof Complexity Lower Bounds Hard?

Rahul Santhanam, Jan Pich, R. Santhanam, 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

Permanent does not have succinct polynomial size arithmetic circuits of constant depth

Rahul Santhanam, Maurice J. Jansen, R. Santhanam, 2011, Inf. Comput..

Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds

Toniann Pitassi, Rahul Santhanam, Yuval Filmus, 2011, ICALP.

Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity

Rahul Santhanam, Richard Ryan Williams, Richard Ryan Williams, 2015, SODA.

Parity helps to compute majority

Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan, 2019, Electron. Colloquium Comput. Complex..

Circuit lower bounds for Merlin-Arthur classes

Rahul Santhanam, R. Santhanam, 2007, STOC '07.

Infeasibility of instance compression and succinct PCPs for NP

Lance Fortnow, Rahul Santhanam, L. Fortnow, 2007, J. Comput. Syst. Sci..

Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability

Rahul Santhanam, R. Santhanam, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Uniform Circuits, Lower Bounds, and QBF Algorithms

Rahul Santhanam, Ryan Williams, Ryan Williams, 2012, Electron. Colloquium Comput. Complex..

Fixed-Polynomial Size Circuit Bounds

Lance Fortnow, Rahul Santhanam, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

Robust Simulations and Significant Separations

Lance Fortnow, Rahul Santhanam, 2011, ICALP.

Holographic Proofs and Derandomization

Rahul Santhanam, Dieter van Melkebeek, 2003, Computational Complexity Conference.

Infeasibility of instance compression and succinct PCPs for NP

Lance Fortnow, Rahul Santhanam, 2011, J. Comput. Syst. Sci..

Macroscopes: models for collective decision making pdf

Rahul Santhanam, Subramanian Ramamoorthy, András Z. Salamon, 2012, ArXiv.

Resource Tradeoffs and Derandomization

Rahul Santhanam, 2002, Electron. Colloquium Comput. Complex..

On the Limits of Sparsification

Rahul Santhanam, Srikanth Srinivasan, 2012, ICALP.

Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness pdf

Igor Carboni Oliveira, Rahul Santhanam, R. Santhanam, 2016, CCC.

Marginal hitting sets imply super-polynomial lower bounds for permanent

Rahul Santhanam, Maurice J. Jansen, R. Santhanam, 2012, ITCS '12.

Robust simulations and significant separations

Lance Fortnow, Rahul Santhanam, 2017, Inf. Comput..

Innovations in Computer Science - ICS 2010

Lance Fortnow, Rahul Santhanam, L. Fortnow, 2010 .

Mathematical Foundations of Computer Science 2009

Rahul Santhanam, Stephen A. Cook, Pierre McKenzie, 2009 .

Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits pdf

Rahul Santhanam, Srikanth Srinivasan, Ruiwen Chen, 2016, CCC.

Pseudo-derandomizing learning and approximation

Igor Carboni Oliveira, Rahul Santhanam, 2018, Electron. Colloquium Comput. Complex..

Lower bounds on the complexity of recognizing SAT by Turing machines

Rahul Santhanam, 2001, Inf. Process. Lett..

Hierarchies for semantic classes

Luca Trevisan, Lance Fortnow, Rahul Santhanam, 2005, STOC '05.

An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0

Igor Carboni Oliveira, Rahul Santhanam, Ruiwen Chen, 2018, LATIN.

Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits

Rahul Santhanam, Srikanth Srinivasan, Ruiwen Chen, 2016, Computational Complexity Conference.

Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds

Rahul Santhanam, R. Santhanam, 2012, Electron. Colloquium Comput. Complex..

Promise Hierarchies

Luca Trevisan, Lance Fortnow, Rahul Santhanam, 2004, Electron. Colloquium Comput. Complex..

Majority is incompressible by AC0[p] circuits

Igor Carboni Oliveira, Rahul Santhanam, R. Santhanam, 2014, Electron. Colloquium Comput. Complex..

Hierarchies Against Sublinear Advice

Lance Fortnow, Rahul Santhanam, 2014, Electron. Colloquium Comput. Complex..

Uniform Hardness Amplification in NP via Monotone Codes

Rahul Santhanam, Valentine Kabanets, Joshua Buresh-Oppenheim, 2006, Electron. Colloquium Comput. Complex..

Time Hierarchies: A Survey

Lance Fortnow, Rahul Santhanam, L. Fortnow, 2007, Electron. Colloquium Comput. Complex..

The Complexity of Explicit Constructions

Rahul Santhanam, 2011, Theory of Computing Systems.

Lower Bounds on Interactive Compressibility by Constant-Depth Circuits

Rahul Santhanam, Arkadev Chattopadhyay, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Pseudodeterministic constructions in subexponential time

Igor Carboni Oliveira, Rahul Santhanam, R. Santhanam, 2016, STOC.

Optimal algorithms and proofs (Dagstuhl Seminar 14421)

Jan Krajícek, Rahul Santhanam, Olaf Beyersdorff, 2014, Dagstuhl Reports.

Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds

Toniann Pitassi, Rahul Santhanam, Yuval Filmus, 2015, TOCT.

Proof Complexity (Dagstuhl Seminar 18051)

Rahul Santhanam, Pavel Pudlák, Albert Atserias, 2018, Dagstuhl Reports.

Bounding Rationality by Discounting Time pdf

Lance Fortnow, Rahul Santhanam, L. Fortnow, 2009, ICS.

Graph model selection using maximum likelihood

Adam Tauman Kalai, Rahul Santhanam, Ivona Bezáková, 2006, ICML.

Circuit lower bounds for Merlin-Arthur classes

Rahul Santhanam, 2007, STOC '07.

Branching Programs for Tree Evaluation

Mark Braverman, Rahul Santhanam, Stephen A. Cook, 2009, MFCS.

New Non-Uniform Lower Bounds for Uniform Classes

Lance Fortnow, Rahul Santhanam, 2016, Computational Complexity Conference.

Making hard problems harder

Rahul Santhanam, Joshua Buresh-Oppenheim, R. Santhanam, 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

Satisfiability on Mixed Instances

Rahul Santhanam, Ruiwen Chen, Ruiwen Chen, 2016, ITCS.

Majority is Incompressible by AC^0[p] Circuits

Igor Carboni Oliveira, Rahul Santhanam, R. Santhanam, 2014, CCC.

Pebbles and Branching Programs for Tree Evaluation pdf

Mark Braverman, Rahul Santhanam, Stephen A. Cook, 2012, TOCT.

On separators, segregators and time versus space

Rahul Santhanam, R. Santhanam, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

Exponential Time Paradigms Through the Polynomial Time Lens

Rahul Santhanam, Andrew Drucker, Jesper Nederlof, 2016, ESA.

New Algorithms for QBF Satisfiability and Implications for Circuit Complexity

Rahul Santhanam, Ryan Williams, Ryan Williams, 2013, Electron. Colloquium Comput. Complex..

Circuit lower bounds from NP-hardness of MCSP under turing reductions

Rahul Santhanam, Michael Saks, M. Saks, 2020, CCC.

On Uniformity and Circuit Lower Bounds

Rahul Santhanam, Ryan Williams, 2014, computational complexity.

Hardness Magnification for Natural Problems

Igor Carboni Oliveira, Rahul Santhanam, R. Santhanam, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Graph splicing systems

Rahul Santhanam, Kamala Krithivasan, 2006, Discret. Appl. Math..

On the Average-Case Complexity of MCSP and Its Variants

Rahul Santhanam, Shuichi Hirahara, R. Santhanam, 2017, CCC.

Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP

Rahul Santhanam, Ruiwen Chen, 2015, SAT.

Permanent does not have succinct polynomial size arithmetic circuits of constant depth

Rahul Santhanam, Maurice J. Jansen, 2013, Inf. Comput..

Hierarchy theorems for probabilistic polynomial time

Lance Fortnow, Rahul Santhanam, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Beyond Natural Proofs: Hardness Magnification and Locality

Rahul Santhanam, Ninad Rajgopal, Shuichi Hirahara, 2019, Electron. Colloquium Comput. Complex..

Instance Compression for the Polynomial Hierarchy and beyond

Rahul Santhanam, Chiranjit Chakraborty, R. Santhanam, 2012, IPEC.

Expander-Based Cryptography Meets Natural Proofs

Igor Carboni Oliveira, Rahul Santhanam, Roei Tell, 2018, Electron. Colloquium Comput. Complex..

Pseudodeterministic algorithms and the structure of probabilistic time

Rahul Santhanam, Zhenjian Lu, Igor C. Oliveira, 2021, Empir. Softw. Eng..

Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121)

Meena Mahajan, Rahul Santhanam, Anna Gál, 2021, Dagstuhl Reports.

Excluding PH Pessiland

Rahul Santhanam, Shuichi Hirahara, R. Santhanam, 2022, ITCS.

Errorless Versus Error-Prone Average-Case Complexity

Rahul Santhanam, Shuichi Hirahara, R. Santhanam, 2022, ITCS.

Constructive Separations and Their Consequences

Rahul Santhanam, Lijie Chen, Ce Jin, 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).

Learning algorithms versus automatability of Frege systems pdf

Rahul Santhanam, J'an Pich, 2021, ArXiv.

Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity

Rahul Santhanam, Hanlin Ren, Rahul Ilango, 2021, Electron. Colloquium Comput. Complex..

Strong co-nondeterministic lower bounds for NP cannot be proved feasibly

Rahul Santhanam, Ján Pich, R. Santhanam, 2021, STOC.

On the pseudo-deterministic query complexity of NP search problems

Russell Impagliazzo, Toniann Pitassi, Rahul Santhanam, 2021, CCC.

A Relativization Perspective on Meta-Complexity

Rahul Santhanam, Hanlin Ren, R. Santhanam, 2021, Electron. Colloquium Comput. Complex..

On the Structure of Learnability Beyond P/Poly

Rahul Santhanam, Ninad Rajgopal, 2021, APPROX-RANDOM.

Hardness of KT characterizes parallel cryptography

Rahul Santhanam, Hanlin Ren, R. Santhanam, 2021, Electron. Colloquium Comput. Complex..

Iterated lower bound formulas: a diagonalization-based approach to proof complexity

Rahul Santhanam, Iddo Tzameret, 2021, STOC.

Optimal Algorithms and Proofs

Rahul Santhanam, Olaf Beyersdorff, Edward A. Hirsch, 2015 .

Explorer On the Limits of Sparsification

Rahul Santhanam, Srikanth Srinivasan, S. Srinivasan, 2012 .