default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamprasad Saptharishi
Person information
- affiliation: Tata Institute of Fundamental Research, Mumbai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j15]Prahladh Harsha, Ramprasad Saptharishi:
On the Elementary Construction of High-Dimensional Expanders by Kaufman and Oppenheim. Theory Comput. 20: 1-22 (2024)- [c24]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. FOCS 2024: 1883-1892 - [c23]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi:
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. SODA 2024: 3901-3918 - [i51]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk:
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. CoRR abs/2403.01965 (2024) - [i50]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk:
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j14]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models. Theory Comput. 19: 1-30 (2023) - [j13]Prerona Chatterjee
, Ramprasad Saptharishi:
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. ACM Trans. Comput. Theory 15(1-2): 1-19 (2023) - [c22]Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. FOCS 2023: 1426-1439 - [i49]Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. CoRR abs/2304.01191 (2023) - [i48]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi:
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. CoRR abs/2309.09701 (2023) - [i47]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. CoRR abs/2311.12752 (2023) - [i46]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi:
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - [i45]Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. Electron. Colloquium Comput. Complex. TR23 (2023) - [i44]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j12]Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness. SIAM J. Comput. 51(2): 315-335 (2022) - [c21]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC 2022: 31:1-31:14 - [c20]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP Is Hard, Then so Are Equations for It. STACS 2022: 44:1-44:13 - [i43]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR abs/2205.10749 (2022) - [i42]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR22 (2022) - 2020
- [c19]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. FOCS 2020: 870-880 - [i41]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. CoRR abs/2004.14147 (2020) - [i40]Prahladh Harsha, Sandeep Juneja, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, A. Y. Sarath, Sharad Shriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan:
COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai. CoRR abs/2006.03375 (2020) - [i39]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 abs/2008.04849 (2020) - [i38]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP is hard, then so are equations for it. CoRR abs/2012.07056 (2020) - [i37]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i36]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP is hard, then so are equations for it. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j11]Mrinal Kumar, Ramprasad Saptharishi:
Hardness-Randomness Tradeoffs for Algebraic Computation. Bull. EATCS 129 (2019) - [j10]Mrinal Kumar, Ramprasad Saptharishi:
The Computational Power of Depth Five Arithmetic Circuits. SIAM J. Comput. 48(1): 144-180 (2019) - [c18]Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. FOCS 2019: 147-157 - [c17]Prerona Chatterjee, Ramprasad Saptharishi:
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. FSTTCS 2019: 11:1-11:14 - [c16]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. ICALP 2019: 78:1-78:15 - [c15]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. SODA 2019: 639-646 - [i35]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. CoRR abs/1902.07063 (2019) - [i34]Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. CoRR abs/1905.00091 (2019) - [i33]Prahladh Harsha, Ramprasad Saptharishi:
A note on the elementary HDX construction of Kaufman-Oppenheim. CoRR abs/1912.11225 (2019) - [i32]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - [i31]Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j9]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. ACM Trans. Comput. Theory 10(1): 3:1-3:30 (2018) - [c14]Ramprasad Saptharishi, Anamay Tengse:
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees. FSTTCS 2018: 6:1-6:19 - [i30]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. CoRR abs/1807.06323 (2018) - [i29]Prerona Chatterjee, Ramprasad Saptharishi:
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. CoRR abs/1812.10249 (2018) - [i28]Prerona Chatterjee, Ramprasad Saptharishi:
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. Electron. Colloquium Comput. Complex. TR18 (2018) - [i27]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j8]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Unexpected power of low-depth arithmetic circuits. Commun. ACM 60(6): 93-100 (2017) - [j7]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Efficiently Decoding Reed-Muller Codes From Random Errors. IEEE Trans. Inf. Theory 63(4): 1954-1960 (2017) - [c13]Mrinal Kumar, Ramprasad Saptharishi:
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields. CCC 2017: 31:1-31:30 - [i26]Ramprasad Saptharishi, Anamay Tengse:
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees. CoRR abs/1709.03068 (2017) - [i25]Ramprasad Saptharishi, Anamay Tengse:
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j6]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Arithmetic Circuits: A Chasm at Depth 3. SIAM J. Comput. 45(3): 1064-1079 (2016) - [j5]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): 1533-1562 (2016) - [c12]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. CCC 2016: 30:1-30:25 - [c11]Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi:
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity. CCC 2016: 33:1-33:19 - [c10]Mrinal Kumar, Ramprasad Saptharishi:
Finer Separations Between Shallow Arithmetic Circuits. FSTTCS 2016: 38:1-38:12 - [c9]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Efficiently decoding Reed-Muller codes from random errors. STOC 2016: 227-235 - [i24]Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi:
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. CoRR abs/1605.04207 (2016) - [i23]Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay:
The Chasm at Depth Four, and Tensor Rank : Old results, new insights. CoRR abs/1606.04200 (2016) - [i22]Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay:
The Chasm at Depth Four, and Tensor Rank : Old results, new insights. Electron. Colloquium Comput. Complex. TR16 (2016) - [i21]Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi:
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i20]Mrinal Kumar, Ramprasad Saptharishi:
Finer separations between shallow arithmetic circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c8]Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat:
On Fortification of Projection Games. APPROX-RANDOM 2015: 497-511 - [i19]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Decoding high rate Reed-Muller codes from random errors in near linear time. CoRR abs/1503.09092 (2015) - [i18]Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat:
On Fortification of General Games. CoRR abs/1504.05556 (2015) - [i17]Mrinal Kumar, Ramprasad Saptharishi:
An exponential lower bound for homogeneous depth-5 circuits over finite fields. CoRR abs/1507.00177 (2015) - [i16]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 abs/1511.07136 (2015) - [i15]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR15 (2015) - [i14]Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat:
On Fortification of General Games. Electron. Colloquium Comput. Complex. TR15 (2015) - [i13]Mrinal Kumar, Ramprasad Saptharishi:
An exponential lower bound for homogeneous depth-5 circuits over finite fields. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j4]Ramprasad Saptharishi:
Recent Progress on Arithmetic Circuit Lower Bounds. Bull. EATCS 114 (2014) - [j3]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Approaching the Chasm at Depth Four. J. ACM 61(6): 33:1-33:16 (2014) - [c7]Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi:
A super-polynomial lower bound for regular arithmetic formulas. STOC 2014: 146-153 - [c6]Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka:
Hitting sets for multilinear read-once algebraic branching programs, in any order. STOC 2014: 867-875 - 2013
- [j2]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Comput. Complex. 22(1): 39-69 (2013) - [j1]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. 42(2): 685-699 (2013) - [c5]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Approaching the Chasm at Depth Four. CCC 2013: 65-73 - [c4]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Arithmetic Circuits: A Chasm at Depth Three. FOCS 2013: 578-587 - [i12]Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka:
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. CoRR abs/1309.5668 (2013) - [i11]Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka:
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. Electron. Colloquium Comput. Complex. TR13 (2013) - [i10]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Arithmetic circuits: A chasm at depth three. Electron. Colloquium Comput. Complex. TR13 (2013) - [i9]Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi:
A super-polynomial lower bound for regular arithmetic formulas. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c3]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: 599-614 - [i8]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. TR12 (2012) - 2011
- [i7]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 abs/1111.0582 (2011) - [i6]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. TR11 (2011) - [i5]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Electron. Colloquium Comput. Complex. TR11 (2011)
2000 – 2009
- 2009
- [c2]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
The Power of Depth 2 Circuits over Algebras. FSTTCS 2009: 371-382 - [i4]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
The Power of Depth 2 Circuits over Algebras. CoRR abs/0904.2058 (2009) - [i3]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
The Power of Depth 2 Circuits over Algebras. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c1]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast integer multiplication using modular arithmetic. STOC 2008: 499-506 - [i2]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic. CoRR abs/0801.1416 (2008) - [i1]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
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 2025-01-09 12:51 CET 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:
