Mrinal Kumar

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 120

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

Computational Complexity Conference

Comput. Complex.

Publications

Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
Fast Multivariate Multipoint Evaluation over All Finite Fields. J. ACM 71 (3) (2024)
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. CoRR (2024)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Decoding Multivariate Multiplicity Codes on Product Sets. IEEE Trans. Inf. Theory 70 (1) (2024)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. ITCS (2024)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. IEEE Trans. Inf. Theory 70 (2) (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)
Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. Electron. Colloquium Comput. Complex. (2023)
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) (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)
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. CoRR (2023)
Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. CoRR (2023)
Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
Fast Numerical Multivariate Multipoint Evaluation. CoRR (2023)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. SODA (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)
Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. J. ACM 70 (6) (2023)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. Electron. Colloquium Comput. Complex. (2023)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. CoRR (2023)
Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
Fast Multivariate Multipoint Evaluation Over All Finite Fields. Electron. Colloquium Comput. Complex. (2022)
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. Comput. Complex. 31 (2) (2022)
Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
Fast Multivariate Multipoint Evaluation Over All Finite Fields. FOCS (2022)
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) (2022)
Mrinal Kumar, Ben Lee Volk
A Lower Bound on Determinantal Complexity. Comput. Complex. 31 (2) (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)
Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra
Fast, algebraic multivariate multipoint evaluation in small characteristic and applications. STOC (2022)
Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
Fast Multivariate Multipoint Evaluation Over All Finite Fields. CoRR (2022)
Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers. Algorithmica 84 (12) (2022)
Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. CoRR (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, A. Shankar
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Electron. Colloquium Comput. Complex. 28 (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Ideal-theoretic Explanation of Capacity-achieving Decoding. CoRR (2021)
Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. Electron. Colloquium Comput. Complex. 28 (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Decoding multivariate multiplicity codes on product sets. STOC (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Ideal-theoretic Explanation of Capacity-achieving Decoding. Electron. Colloquium Comput. Complex. 28 (2021)
Mrinal Kumar, Ben Lee Volk
A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits. ITCS (2021)
Mrinal Kumar, Ben Lee Volk
A Lower Bound on Determinantal Complexity. Computational Complexity Conference (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM (2021)
Ben Lee Volk, Mrinal Kumar
Lower Bounds for Matrix Factorization. Comput. Complex. 30 (1) (2021)
Mrinal Kumar, Ben Lee Volk
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. Electron. Colloquium Comput. Complex. 27 (2020)
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
A Quadratic Lower Bound for Algebraic Branching Programs. Computational Complexity Conference (2020)
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. Computational Complexity Conference (2020)
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
On the Existence of Algebraically Natural Proofs. Electron. Colloquium Comput. Complex. 27 (2020)
Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers. Electron. Colloquium Comput. Complex. 27 (2020)
Mrinal Kumar, Ben Lee Volk
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. CoRR (2020)
Mrinal Kumar, Ben Lee Volk
Lower Bounds for Matrix Factorization. Computational Complexity Conference (2020)
Noga Alon, Mrinal Kumar, Ben Lee Volk
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Comb. 40 (2) (2020)
Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
If VNP is hard, then so are equations for it. CoRR (2020)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM (2020)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Decoding Multivariate Multiplicity Codes on Product Sets. CoRR (2020)
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
On the Existence of Algebraically Natural Proofs. FOCS (2020)
Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers. CoRR (2020)
Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers. LATIN (2020)
Mrinal Kumar, Ben Lee Volk
A Lower Bound on Determinantal Complexity. CoRR (2020)
Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
On the Existence of Algebraically Natural Proofs. CoRR (2020)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Decoding Multivariate Multiplicity Codes on Product Sets. Electron. Colloquium Comput. Complex. 27 (2020)
Mrinal Kumar, Ben Lee Volk
A Lower Bound on Determinantal Complexity. Electron. Colloquium Comput. Complex. 27 (2020)
Mrinal Kumar
On the Power of Border of Depth-3 Arithmetic Circuits. ACM Trans. Comput. Theory 12 (1) (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)
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
A Quadratic Lower Bound for Algebraic Branching Programs. CoRR (2019)
Mrinal Kumar
A quadratic lower bound for homogeneous algebraic branching programs. Comput. Complex. 28 (3) (2019)
Chi-Ning Chou, Mrinal Kumar, Noam Solomon
Closure of VP under taking factors: a short and simple proof. CoRR (2019)
Mrinal Kumar, Ben Lee Volk
Lower Bounds for Matrix Factorization. Electron. Colloquium Comput. Complex. 26 (2019)
Mrinal Kumar, Ben Lee Volk
Lower Bounds for Matrix Factorization. CoRR (2019)
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)
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
A Quadratic Lower Bound for Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 26 (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)
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. 26 (2019)
Chi-Ning Chou, Mrinal Kumar, Noam Solomon
Closure Results for Polynomial Factorization. Theory Comput. 15 (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)
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 (2019)
Mrinal Kumar, Ramprasad Saptharishi
Hardness-Randomness Tradeoffs for Algebraic Computation. Bull. EATCS 129 (2019)
Chi-Ning Chou, Mrinal Kumar, Noam Solomon
Closure of VP under taking factors: a short and simple proof. Electron. Colloquium Comput. Complex. 26 (2019)
Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. Electron. Colloquium Comput. Complex. 26 (2019)
Chi-Ning Chou, Mrinal Kumar, Noam Solomon
Hardness vs Randomness for Bounded Depth Arithmetic Circuits. Computational Complexity Conference (2018)
Noga Alon, Mrinal Kumar, Ben Lee Volk
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Computational Complexity Conference (2018)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR (2018)
Mrinal Kumar
On top fan-in vs formal degree for depth-3 arithmetic circuits. CoRR (2018)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. 25 (2018)
Chi-Ning Chou, Mrinal Kumar, Noam Solomon
Some Closure Results for Polynomial Factorization and Applications. CoRR (2018)
Mrinal Kumar, Shubhangi Saraf
Arithmetic Circuits with Locally Low Algebraic Rank. CoRR (2018)
Mrinal Kumar
On top fan-in vs formal degree for depth-3 arithmetic circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. CoRR (2018)
Chi-Ning Chou, Mrinal Kumar, Noam Solomon
Some Closure Results for Polynomial Factorization and Applications. Electron. Colloquium Comput. Complex. 25 (2018)
Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Mrinal Kumar, Ben Lee Volk
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Electron. Colloquium Comput. Complex. 24 (2017)
Mrinal Kumar
A quadratic lower bound for homogeneous algebraic branching programs. Electron. Colloquium Comput. Complex. 24 (2017)
Mrinal Kumar, Shubhangi Saraf
Arithmetic Circuits with Locally Low Algebraic Rank. Theory Comput. 13 (1) (2017)
Mrinal Kumar, Shubhangi Saraf
On the Power of Homogeneous Depth 4 Arithmetic Circuits. SIAM J. Comput. 46 (1) (2017)
Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, Shubhangi Saraf
Towards an algebraic natural proofs barrier via polynomial identity testing. Electron. Colloquium Comput. Complex. 24 (2017)
Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, Shubhangi Saraf
Towards an algebraic natural proofs barrier via polynomial identity testing. CoRR (2017)
Mrinal Kumar, Ben Lee Volk
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CoRR (2017)
Mrinal Kumar, Ramprasad Saptharishi
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields. Computational Complexity Conference (2017)
Mrinal Kumar
A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs. Computational Complexity Conference (2017)

Mrinal Kumar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mrinal Kumar