Ramprasad Saptharishi

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 56

Top Topics

Computational Power

Top Venues

Electron. Colloquium Comput. Complex.

SIAM J. Comput.

Publications

Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. CoRR (2024)
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. SODA (2024)
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. Electron. Colloquium Comput. Complex. (2024)
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. Electron. Colloquium Comput. Complex. (2023)
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
An Improved Line-Point Low-Degree Test. CoRR (2023)
Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
Fast Numerical Multivariate Multipoint Evaluation. Electron. Colloquium Comput. Complex. (2023)
Prerona Chatterjee, Ramprasad Saptharishi
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. ACM Trans. Comput. Theory 15 (1-2) (2023)
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. CoRR (2023)
Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
Fast Numerical Multivariate Multipoint Evaluation. CoRR (2023)
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
An Improved Line-Point Low-Degree Test. Electron. Colloquium Comput. Complex. (2023)
Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi
Fast Numerical Multivariate Multipoint Evaluation. FOCS (2023)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. (2022)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR (2022)
Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
If VNP Is Hard, Then so Are Equations for It. STACS (2022)
Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
Derandomization from Algebraic Hardness. SIAM J. Comput. 51 (2) (2022)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC (2022)
Prahladh Harsha, Sandeep Juneja, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, A. Y. Sarath, Sharad Sriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan
COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai. CoRR (2020)
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
On the Existence of Algebraically Natural Proofs. Electron. Colloquium Comput. Complex. 27 (2020)
Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
If VNP is hard, then so are equations for it. CoRR (2020)
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
On the Existence of Algebraically Natural Proofs. FOCS (2020)
Shubhada Agrawal, Siddharth Bhandari, Anirban Bhattacharjee, Anand Deo, Narendra M. Dixit, Prahladh Harsha, Sandeep Juneja, Poonam Kesarwani, Aditya Krishna Swamy, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, Sharad Shriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan, Sarath Yasodharan
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic. CoRR (2020)
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
On the Existence of Algebraically Natural Proofs. CoRR (2020)
Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
If VNP is hard, then so are equations for it. Electron. Colloquium Comput. Complex. 27 (2020)
Mrinal Kumar, Ramprasad Saptharishi
The Computational Power of Depth Five Arithmetic Circuits. SIAM J. Comput. 48 (1) (2019)
Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
Derandomization from Algebraic Hardness: Treading the Borders. FOCS (2019)
Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
Derandomization from Algebraic Hardness: Treading the Borders. CoRR (2019)
Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. ICALP (2019)
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. SODA (2019)
Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. CoRR (2019)
Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
Derandomization from Algebraic Hardness: Treading the Borders. Electron. Colloquium Comput. Complex. 26 (2019)
Prerona Chatterjee, Ramprasad Saptharishi
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. FSTTCS (2019)
Prahladh Harsha, Ramprasad Saptharishi
A note on the elementary HDX construction of Kaufman-Oppenheim. CoRR (2019)
Mrinal Kumar, Ramprasad Saptharishi
Hardness-Randomness Tradeoffs for Algebraic Computation. Bull. EATCS 129 (2019)
Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. Electron. Colloquium Comput. Complex. 26 (2019)
Prerona Chatterjee, Ramprasad Saptharishi
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. Electron. Colloquium Comput. Complex. 25 (2018)
Ramprasad Saptharishi, Anamay Tengse
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees. FSTTCS (2018)
Prerona Chatterjee, Ramprasad Saptharishi
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. CoRR (2018)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Oblivious Algebraic Branching Programs. ACM Trans. Comput. Theory 10 (1) (2018)
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. CoRR (2018)
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Ramprasad Saptharishi, Anamay Tengse
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees. CoRR (2017)
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Efficiently Decoding Reed-Muller Codes From Random Errors. IEEE Trans. Inf. Theory 63 (4) (2017)
Ramprasad Saptharishi, Anamay Tengse
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. 24 (2017)
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
Unexpected power of low-depth arithmetic circuits. Commun. ACM 60 (6) (2017)
Mrinal Kumar, Ramprasad Saptharishi
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields. Computational Complexity Conference (2017)
Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay
The Chasm at Depth Four, and Tensor Rank : Old results, new insights. CoRR (2016)
Mrinal Kumar, Ramprasad Saptharishi
Finer Separations Between Shallow Arithmetic Circuits. FSTTCS (2016)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. Computational Complexity Conference (2016)
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
Arithmetic Circuits: A Chasm at Depth 3. SIAM J. Comput. 45 (3) (2016)
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. CoRR (2016)
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. Electron. Colloquium Comput. Complex. 23 (2016)
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. SIAM J. Comput. 45 (4) (2016)
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity. Computational Complexity Conference (2016)
Mrinal Kumar, Ramprasad Saptharishi
Finer separations between shallow arithmetic circuits. Electron. Colloquium Comput. Complex. 23 (2016)
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Efficiently decoding Reed-Muller codes from random errors. STOC (2016)
Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay
The Chasm at Depth Four, and Tensor Rank : Old results, new insights. Electron. Colloquium Comput. Complex. 23 (2016)
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Decoding high rate Reed-Muller codes from random errors in near linear time. CoRR (2015)
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
On Fortification of General Games. CoRR (2015)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs. CoRR (2015)
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
On Fortification of General Games. Electron. Colloquium Comput. Complex. 22 (2015)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 22 (2015)
Mrinal Kumar, Ramprasad Saptharishi
An exponential lower bound for homogeneous depth-5 circuits over finite fields. Electron. Colloquium Comput. Complex. 22 (2015)
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
On Fortification of Projection Games. APPROX-RANDOM (2015)
Mrinal Kumar, Ramprasad Saptharishi
An exponential lower bound for homogeneous depth-5 circuits over finite fields. CoRR (2015)
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
Hitting sets for multilinear read-once algebraic branching programs, in any order. STOC (2014)
Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi
A super-polynomial lower bound for regular arithmetic formulas. STOC (2014)
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
Approaching the Chasm at Depth Four. J. ACM 61 (6) (2014)
Ramprasad Saptharishi
Recent Progress on Arithmetic Circuit Lower Bounds. Bull. EATCS 114 (2014)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. 42 (2) (2013)
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
Arithmetic Circuits: A Chasm at Depth Three. FOCS (2013)
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
Approaching the Chasm at Depth Four. Computational Complexity Conference (2013)
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. Electron. Colloquium Comput. Complex. 20 (2013)
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
Arithmetic circuits: A chasm at depth three. Electron. Colloquium Comput. Complex. 20 (2013)
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. CoRR (2013)
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Comput. Complex. 22 (1) (2013)
Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi
A super-polynomial lower bound for regular arithmetic formulas. Electron. Colloquium Comput. Complex. 20 (2013)
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin. Electron. Colloquium Comput. Complex. 19 (2012)
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. STOC (2012)
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. Electron. Colloquium Comput. Complex. 18 (2011)
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Electron. Colloquium Comput. Complex. 18 (2011)
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits CoRR (2011)
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
The Power of Depth 2 Circuits over Algebras CoRR (2009)
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
The Power of Depth 2 Circuits over Algebras. FSTTCS (2009)
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
The Power of Depth 2 Circuits over Algebras. Electron. Colloquium Comput. Complex. 16 (2009)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast integer multiplication using modular arithmetic. STOC (2008)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast Integer Multiplication using Modular Arithmetic CoRR (2008)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast Integer Multiplication using Modular Arithmetic. Electron. Colloquium Comput. Complex. 15 (023) (2008)