Ramprasad Saptharishi

100 papers A* 14A 6Journal 75Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits.
ACM Trans. Comput. Theory
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
2025 J jnl
An exposition of recent list-size bounds of FRS Codes.
CoRR
Abhibhav Garg, Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Ashutosh Shankar
2025 J jnl
An exposition of recent list-size bounds of FRS Codes.
Electron. Colloquium Comput. Complex.
Abhibhav Garg, Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Ashutosh Shankar
2025 J jnl
Closure under factorization from a result of Furstenberg.
CoRR
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025 J jnl
Closure under factorization from a result of Furstenberg.
Electron. Colloquium Comput. Complex.
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025 J jnl
Constant-depth circuits for polynomial GCD over any characteristic.
CoRR
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025 J jnl
Constant-depth circuits for polynomial GCD over any characteristic.
Electron. Colloquium Comput. Complex.
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu S. Rai, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025 A* conf
Deterministic factorization of constant-depth algebraic circuits in subexponential time.
FOCS
Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025 J jnl
Deterministic factorization of constant-depth algebraic circuits in subexponential time.
CoRR
Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2025 J jnl
Deterministic factorization of constant-depth algebraic circuits in subexponential time.
Electron. Colloquium Comput. Complex.
Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf
2024 A* conf
An Improved Line-Point Low-Degree Test.
FOCS
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2024 A* conf
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits.
SODA
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
2024 J jnl
On the Elementary Construction of High-Dimensional Expanders by Kaufman and Oppenheim.
Theory Comput.
Prahladh Harsha, Ramprasad Saptharishi
2024 J jnl
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits.
CoRR
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
2024 J jnl
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
2023 J jnl
An Improved Line-Point Low-Degree Test.
CoRR
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2023 J jnl
An Improved Line-Point Low-Degree Test.
Electron. Colloquium Comput. Complex.
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2023 J jnl
Constructing Faithful Homomorphisms over Fields of Finite Characteristic.
ACM Trans. Comput. Theory
Prerona Chatterjee, Ramprasad Saptharishi
2023 J jnl
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits.
CoRR
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
2023 J jnl
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
2023 A* conf
Fast Numerical Multivariate Multipoint Evaluation.
FOCS
Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023 J jnl
Fast Numerical Multivariate Multipoint Evaluation.
CoRR
Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023 J jnl
Fast Numerical Multivariate Multipoint Evaluation.
Electron. Colloquium Comput. Complex.
Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023 J jnl
Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models.
Theory Comput.
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
2022 J jnl
Derandomization from Algebraic Hardness.
SIAM J. Comput.
Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2022 A conf
If VNP Is Hard, Then so Are Equations for It.
STACS
Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2022 A conf
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes.
CCC
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2022 J jnl
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes.
CoRR
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2022 J jnl
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes.
Electron. Colloquium Comput. Complex.
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2020 J jnl
COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai.
CoRR
Prahladh Harsha, Sandeep Juneja, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, A. Y. Sarath, Sharad Shriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan
2020 J jnl
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic.
CoRR
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
2020 J jnl
If VNP is hard, then so are equations for it.
CoRR
Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020 J jnl
If VNP is hard, then so are equations for it.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020 A* conf
On the Existence of Algebraically Natural Proofs.
FOCS
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020 J jnl
On the Existence of Algebraically Natural Proofs.
CoRR
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2020 J jnl
On the Existence of Algebraically Natural Proofs.
Electron. Colloquium Comput. Complex.
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
2019 J jnl
A note on the elementary HDX construction of Kaufman-Oppenheim.
CoRR
Prahladh Harsha, Ramprasad Saptharishi
2019 — conf
Constructing Faithful Homomorphisms over Fields of Finite Characteristic.
FSTTCS
Prerona Chatterjee, Ramprasad Saptharishi
2019 A* conf
Derandomization from Algebraic Hardness: Treading the Borders.
FOCS
Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2019 J jnl
Derandomization from Algebraic Hardness: Treading the Borders.
CoRR
Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2019 J jnl
Derandomization from Algebraic Hardness: Treading the Borders.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2019 J jnl
Hardness-Randomness Tradeoffs for Algebraic Computation.
Bull. EATCS
Mrinal Kumar, Ramprasad Saptharishi
2019 A* conf
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits.
SODA
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
2019 J jnl
The Computational Power of Depth Five Arithmetic Circuits.
SIAM J. Comput.
Mrinal Kumar, Ramprasad Saptharishi
2019 A* conf
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits.
ICALP
Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
2019 J jnl
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits.
CoRR
Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
2019 J jnl
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
2018 J jnl
Constructing Faithful Homomorphisms over Fields of Finite Characteristic.
CoRR
Prerona Chatterjee, Ramprasad Saptharishi
2018 J jnl
Constructing Faithful Homomorphisms over Fields of Finite Characteristic.
Electron. Colloquium Comput. Complex.
Prerona Chatterjee, Ramprasad Saptharishi
2018 J jnl
Identity Testing and Lower Bounds for Read-
ACM Trans. Comput. Theory
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
2018 J jnl
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits.
CoRR
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
2018 J jnl
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
2018 — conf
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees.
FSTTCS
Ramprasad Saptharishi, Anamay Tengse
2017 A conf
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields.
CCC
Mrinal Kumar, Ramprasad Saptharishi
2017 J jnl
Efficiently Decoding Reed-Muller Codes From Random Errors.
IEEE Trans. Inf. Theory
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
2017 J jnl
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees.
CoRR
Ramprasad Saptharishi, Anamay Tengse
2017 J jnl
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees.
Electron. Colloquium Comput. Complex.
Ramprasad Saptharishi, Anamay Tengse
2017 J jnl
Unexpected power of low-depth arithmetic circuits.
Commun. ACM
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2016 J jnl
Arithmetic Circuits: A Chasm at Depth 3.
SIAM J. Comput.
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2016 A* conf
Efficiently decoding Reed-Muller codes from random errors.
STOC
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
2016 — conf
Finer Separations Between Shallow Arithmetic Circuits.
FSTTCS
Mrinal Kumar, Ramprasad Saptharishi
2016 J jnl
Finer separations between shallow arithmetic circuits.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Ramprasad Saptharishi
2016 A conf
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity.
CCC
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
2016 J jnl
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity.
CoRR
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
2016 J jnl
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity.
Electron. Colloquium Comput. Complex.
Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi
2016 A conf
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs.
CCC
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
2016 J jnl
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits.
SIAM J. Comput.
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2016 J jnl
The Chasm at Depth Four, and Tensor Rank : Old results, new insights.
CoRR
Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay
2016 J jnl
The Chasm at Depth Four, and Tensor Rank : Old results, new insights.
Electron. Colloquium Comput. Complex.
Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay
2015 J jnl
An exponential lower bound for homogeneous depth-5 circuits over finite fields.
CoRR
Mrinal Kumar, Ramprasad Saptharishi
2015 J jnl
An exponential lower bound for homogeneous depth-5 circuits over finite fields.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Ramprasad Saptharishi
2015 J jnl
Decoding high rate Reed-Muller codes from random errors in near linear time.
CoRR
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
2015 J jnl
Identity Testing and Lower Bounds for Read-
Electron. Colloquium Comput. Complex.
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
2015 J jnl
Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs.
CoRR
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
2015 J jnl
On Fortification of General Games.
CoRR
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
2015 J jnl
On Fortification of General Games.
Electron. Colloquium Comput. Complex.
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
2015 — conf
On Fortification of Projection Games.
APPROX-RANDOM
Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat
2014 A* conf
A super-polynomial lower bound for regular arithmetic formulas.
STOC
Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi
2014 J jnl
Approaching the Chasm at Depth Four.
J. ACM
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2014 A* conf
Hitting sets for multilinear read-once algebraic branching programs, in any order.
STOC
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
2014 J jnl
Recent Progress on Arithmetic Circuit Lower Bounds.
Bull. EATCS
Ramprasad Saptharishi
2013 J jnl
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality.
Comput. Complex.
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2013 J jnl
A super-polynomial lower bound for regular arithmetic formulas.
Electron. Colloquium Comput. Complex.
Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi
2013 A conf
Approaching the Chasm at Depth Four.
CCC
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2013 A* conf
Arithmetic Circuits: A Chasm at Depth Three.
FOCS
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2013 J jnl
Arithmetic circuits: A chasm at depth three.
Electron. Colloquium Comput. Complex.
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2013 J jnl
Fast Integer Multiplication Using Modular Arithmetic.
SIAM J. Comput.
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
2013 J jnl
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order.
CoRR
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
2013 J jnl
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order.
Electron. Colloquium Comput. Complex.
Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka
2012 J jnl
An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin.
Electron. Colloquium Comput. Complex.
Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
2012 A* conf
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits.
STOC
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2011 J jnl
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality.
Electron. Colloquium Comput. Complex.
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2011 J jnl
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
CoRR
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2011 J jnl
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits.
Electron. Colloquium Comput. Complex.
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2009 J jnl
The Power of Depth 2 Circuits over Algebras
CoRR
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2009 — conf
The Power of Depth 2 Circuits over Algebras.
FSTTCS
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2009 J jnl
The Power of Depth 2 Circuits over Algebras.
Electron. Colloquium Comput. Complex.
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
2008 J jnl
Fast Integer Multiplication using Modular Arithmetic
CoRR
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
2008 J jnl
Fast Integer Multiplication using Modular Arithmetic.
Electron. Colloquium Comput. Complex.
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
2008 A* conf
Fast integer multiplication using modular arithmetic.
STOC
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi