Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMrinal Kumar 0001
Person information
- affiliation: Tata Institute of Fundamental Research, Mumbai, India
- affiliation (former): Indian Institute of Technology Bombay, Mumbai, India
- affiliation (former): University of Toronto, Canada
- affiliation (former): Harvard University, Cambridge, MA, USA
- affiliation (PhD): Rutgers University, Newark, NJ, USA
Other persons with the same name
- Mrinal Kumar 0002
![[0000-0001-9747-9449]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9747-9449")
— Ohio State University, Department of Mechanical and Aerospace University, Columbus, OH, USA (and 2 more) - Mrinal Kumar 0003 — Maharashtra Institute of Technology, Optimization and Agent Technology (OAT) Research Lab, Pune, India
- Mrinal Kumar 0004 — Georgia Institute of Technology, Atlanta, GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j23]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. IEEE Trans. Inf. Theory 70(1): 154-169 (2024)- [j22]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. IEEE Trans. Inf. Theory 70(2): 1107-1123 (2024) - [c35]Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. ITCS 2024: 27:1-27:13 - [c34]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi:
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. SODA 2024: 3901-3918 - [i80]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) - [i79]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: TR24-043 (2024) - 2023
- [j21]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Comput. Complex. 32(1): 3 (2023) - [j20]Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra:
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. J. ACM 70(6): 42:1-42:46 (2023) - [c33]Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. FOCS 2023: 1426-1439 - [c32]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. SODA 2023: 2816-2835 - [i78]Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. CoRR abs/2304.01191 (2023) - [i77]Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. CoRR abs/2308.04599 (2023) - [i76]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi:
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. CoRR abs/2309.09701 (2023) - [i75]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. CoRR abs/2311.12752 (2023) - [i74]Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. CoRR abs/2311.17841 (2023) - [i73]Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi:
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - [i72]Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR23 (2023) - [i71]Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. Electron. Colloquium Comput. Complex. TR23 (2023) - [i70]Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i69]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j19]Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. Algorithmica 84(12): 3655-3685 (2022) - [j18]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. Comput. Complex. 31(2): 8 (2022) - [j17]Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. Comput. Complex. 31(2): 12 (2022) - [j16]Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness. SIAM J. Comput. 51(2): 315-335 (2022) - [j15]Ben Lee Volk, Mrinal Kumar:
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits. ACM Trans. Comput. Theory 14(2): 6:1-6:14 (2022) - [c31]Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans:
Fast Multivariate Multipoint Evaluation Over All Finite Fields. FOCS 2022: 221-232 - [c30]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP Is Hard, Then so Are Equations for It. STACS 2022: 44:1-44:13 - [c29]Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra:
Fast, algebraic multivariate multipoint evaluation in small characteristic and applications. STOC 2022: 403-415 - [i68]Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans:
Fast Multivariate Multipoint Evaluation Over All Finite Fields. CoRR abs/2205.00342 (2022) - [i67]Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans:
Fast Multivariate Multipoint Evaluation Over All Finite Fields. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j14]Ben Lee Volk, Mrinal Kumar:
Lower Bounds for Matrix Factorization. Comput. Complex. 30(1): 6 (2021) - [c28]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM 2021: 56:1-56:21 - [c27]Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. CCC 2021: 4:1-4:12 - [c26]Mrinal Kumar, Ben Lee Volk:
A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits. ITCS 2021: 9:1-9:9 - [c25]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding multivariate multiplicity codes on product sets. STOC 2021: 1489-1501 - [i66]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. CoRR abs/2103.07930 (2021) - [i65]Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra:
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. CoRR abs/2111.07572 (2021) - [i64]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. CoRR abs/2111.11072 (2021) - [i63]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. Electron. Colloquium Comput. Complex. TR21 (2021) - [i62]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Electron. Colloquium Comput. Complex. TR21 (2021) - [i61]Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra:
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j13]Noga Alon, Mrinal Kumar, Ben Lee Volk:
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Comb. 40(2): 149-178 (2020) - [j12]Mrinal Kumar:
On the Power of Border of Depth-3 Arithmetic Circuits. ACM Trans. Comput. Theory 12(1): 5:1-5:8 (2020) - [c24]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM 2020: 29:1-29:23 - [c23]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. CCC 2020: 2:1-2:21 - [c22]Mrinal Kumar, Ben Lee Volk:
Lower Bounds for Matrix Factorization. CCC 2020: 5:1-5:20 - [c21]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. CCC 2020: 14:1-14:27 - [c20]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. FOCS 2020: 870-880 - [c19]Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. LATIN 2020: 311-322 - [i60]Mrinal Kumar, Ben Lee Volk:
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. CoRR abs/2003.12938 (2020) - [i59]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. CoRR abs/2004.14147 (2020) - [i58]Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. CoRR abs/2009.02452 (2020) - [i57]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. CoRR abs/2012.01530 (2020) - [i56]Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. CoRR abs/2012.03883 (2020) - [i55]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP is hard, then so are equations for it. CoRR abs/2012.07056 (2020) - [i54]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. Electron. Colloquium Comput. Complex. TR20 (2020) - [i53]Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. Electron. Colloquium Comput. Complex. TR20 (2020) - [i52]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i51]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP is hard, then so are equations for it. Electron. Colloquium Comput. Complex. TR20 (2020) - [i50]Mrinal Kumar, Ben Lee Volk:
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. Electron. Colloquium Comput. Complex. TR20 (2020) - [i49]Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j11]Mrinal Kumar:
A quadratic lower bound for homogeneous algebraic branching programs. Comput. Complex. 28(3): 409-435 (2019) - [j10]Mrinal Kumar, Ramprasad Saptharishi:
Hardness-Randomness Tradeoffs for Algebraic Computation. Bull. EATCS 129 (2019) - [j9]Mrinal Kumar, Ramprasad Saptharishi:
The Computational Power of Depth Five Arithmetic Circuits. SIAM J. Comput. 48(1): 144-180 (2019) - [j8]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure Results for Polynomial Factorization. Theory Comput. 15: 1-34 (2019) - [c18]Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. FOCS 2019: 147-157 - [c17]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. ICALP 2019: 78:1-78:15 - [c16]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. SODA 2019: 639-646 - [i48]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. CoRR abs/1902.07063 (2019) - [i47]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure of VP under taking factors: a short and simple proof. CoRR abs/1903.02366 (2019) - [i46]Mrinal Kumar, Ben Lee Volk:
Lower Bounds for Matrix Factorization. CoRR abs/1904.01182 (2019) - [i45]Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. CoRR abs/1905.00091 (2019) - [i44]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. CoRR abs/1911.11793 (2019) - [i43]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! CoRR abs/1911.12520 (2019) - [i42]Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i41]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! Electron. Colloquium Comput. Complex. TR19 (2019) - [i40]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure of VP under taking factors: a short and simple proof. Electron. Colloquium Comput. Complex. TR19 (2019) - [i39]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - [i38]Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. Electron. Colloquium Comput. Complex. TR19 (2019) - [i37]Mrinal Kumar, Ben Lee Volk:
Lower Bounds for Matrix Factorization. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c15]Noga Alon, Mrinal Kumar, Ben Lee Volk:
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CCC 2018: 11:1-11:16 - [c14]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Hardness vs Randomness for Bounded Depth Arithmetic Circuits. CCC 2018: 13:1-13:17 - [i36]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Some Closure Results for Polynomial Factorization and Applications. CoRR abs/1803.05933 (2018) - [i35]Mrinal Kumar:
On top fan-in vs formal degree for depth-3 arithmetic circuits. CoRR abs/1804.03303 (2018) - [i34]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR abs/1804.09124 (2018) - [i33]Mrinal Kumar, Shubhangi Saraf:
Arithmetic Circuits with Locally Low Algebraic Rank. CoRR abs/1806.06097 (2018) - [i32]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. CoRR abs/1807.06323 (2018) - [i31]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. TR18 (2018) - [i30]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Some Closure Results for Polynomial Factorization and Applications. Electron. Colloquium Comput. Complex. TR18 (2018) - [i29]Mrinal Kumar:
On top fan-in vs formal degree for depth-3 arithmetic circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i28]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j7]Mrinal Kumar, Shubhangi Saraf:
On the Power of Homogeneous Depth 4 Arithmetic Circuits. SIAM J. Comput. 46(1): 336-387 (2017) - [j6]Mrinal Kumar, Shubhangi Saraf:
Arithmetic Circuits with Locally Low Algebraic Rank. Theory Comput. 13(1): 1-33 (2017) - [c13]Mrinal Kumar:
A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs. CCC 2017: 19:1-19:16 - [c12]Mrinal Kumar, Ramprasad Saptharishi:
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields. CCC 2017: 31:1-31:30 - [i27]Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, Shubhangi Saraf:
Towards an algebraic natural proofs barrier via polynomial identity testing. CoRR abs/1701.01717 (2017) - [i26]Mrinal Kumar, Ben Lee Volk:
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CoRR abs/1708.02037 (2017) - [i25]Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, Shubhangi Saraf:
Towards an algebraic natural proofs barrier via polynomial identity testing. Electron. Colloquium Comput. Complex. TR17 (2017) - [i24]Mrinal Kumar:
A quadratic lower bound for homogeneous algebraic branching programs. Electron. Colloquium Comput. Complex. TR17 (2017) - [i23]Mrinal Kumar, Ben Lee Volk:
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j5]Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. Theory Comput. 12(1): 1-27 (2016) - [j4]Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices. ACM Trans. Comput. Theory 8(3): 8:1-8:17 (2016) - [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, Shubhangi Saraf:
Arithmetic Circuits with Locally Low Algebraic Rank. CCC 2016: 34:1-34:27 - [c9]Mrinal Kumar, Shubhangi Saraf:
Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing. CCC 2016: 35:1-35:29 - [c8]Mrinal Kumar, Ramprasad Saptharishi:
Finer Separations Between Shallow Arithmetic Circuits. FSTTCS 2016: 38:1-38:12 - [i22]Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi:
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. CoRR abs/1605.04207 (2016) - [i21]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) - [i20]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) - [i19]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) - [i18]Mrinal Kumar, Ramprasad Saptharishi:
Finer separations between shallow arithmetic circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j3]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71(4): 989-1006 (2015) - [j2]Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In. SIAM J. Comput. 44(6): 1601-1625 (2015) - [i17]Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient indexing of necklaces and irreducible polynomials over finite fields. CoRR abs/1504.00572 (2015) - [i16]Mrinal Kumar, Shubhangi Saraf:
Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. CoRR abs/1504.06213 (2015) - [i15]Mrinal Kumar, Ramprasad Saptharishi:
An exponential lower bound for homogeneous depth-5 circuits over finite fields. CoRR abs/1507.00177 (2015) - [i14]Mrinal Kumar, Shubhangi Saraf:
Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. Electron. Colloquium Comput. Complex. TR15 (2015) - [i13]Mrinal Kumar, Shubhangi Saraf:
Arithmetic circuits with locally low algebraic rank. Electron. Colloquium Comput. Complex. TR15 (2015) - [i12]Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient indexing of necklaces and irreducible polynomials over finite fields. Electron. Colloquium Comput. Complex. TR15 (2015) - [i11]Mrinal Kumar, Ramprasad Saptharishi:
An exponential lower bound for homogeneous depth-5 circuits over finite fields. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j1]Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh:
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theor. Comput. Sci. 526: 90-96 (2014) - [c7]Mrinal Kumar, Shubhangi Saraf:
On the Power of Homogeneous Depth 4 Arithmetic Circuits. FOCS 2014: 364-373 - [c6]Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. ICALP (1) 2014: 726-737 - [c5]Mrinal Kumar, Shubhangi Saraf:
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits. ICALP (1) 2014: 751-762 - [c4]Mrinal Kumar, Shubhangi Saraf:
The limits of depth reduction for arithmetic formulas: it's all about the top fan-in. STOC 2014: 136-145 - [i10]Mrinal Kumar, Shubhangi Saraf:
On the power of homogeneous depth 4 arithmetic circuits. CoRR abs/1404.1950 (2014) - [i9]Mrinal Kumar, Shubhangi Saraf:
On the power of homogeneous depth 4 arithmetic circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c3]Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via MaxRank. ICALP (1) 2013: 661-672 - [i8]Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via MaxRank. CoRR abs/1302.3308 (2013) - [i7]Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in. CoRR abs/1311.6716 (2013) - [i6]Mrinal Kumar, Shubhangi Saraf:
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. CoRR abs/1312.5978 (2013) - [i5]Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via MaxRank. Electron. Colloquium Comput. Complex. TR13 (2013) - [i4]Mrinal Kumar, Shubhangi Saraf:
Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. Electron. Colloquium Comput. Complex. TR13 (2013) - [i3]Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in. Electron. Colloquium Comput. Complex. TR13 (2013) - [i2]Mrinal Kumar, Shubhangi Saraf:
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c2]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT 2012: 107-118 - 2011
- [c1]Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh:
Approximation Algorithms for Minimum Chain Vertex Deletion. WALCOM 2011: 21-32 - [i1]Mrinal Kumar, Gaurav Maheshwari, N. Sadagopan:
A Characterization of all Stable Minimal Separator Graphs. CoRR abs/1103.2913 (2011)
Coauthor Index
a service of 
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-04-25 02:11 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:
