| On the power of homogeneous depth 4 arithmetic circuits M Kumar, S Saraf SIAM Journal on Computing 46 (1), 336-387, 2017 | 88 | 2017 |
| Faster parameterized algorithms for deletion to split graphs E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan Algorithmica 71 (4), 989-1006, 2015 | 49 | 2015 |
| The limits of depth reduction for arithmetic formulas: It's all about the top fan-in M Kumar, S Saraf Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 44 | 2014 |
| Arithmetic circuits with locally low algebraic rank M Kumar, S Saraf arXiv preprint arXiv:1806.06097, 2018 | 34 | 2018 |
| Towards an algebraic natural proofs barrier via polynomial identity testing JA Grochow, M Kumar, M Saks, S Saraf arXiv preprint arXiv:1701.01717, 2017 | 34 | 2017 |
| Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits N Alon, M Kumar, BL Volk Combinatorica 40 (2), 149-178, 2020 | 29 | 2020 |
| Near-optimal bootstrapping of hitting sets for algebraic circuits M Kumar, R Saptharishi, A Tengse Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 28 | 2019 |
| Derandomization from algebraic hardness: Treading the borders Z Guo, M Kumar, R Saptharishi, N Solomon 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 25 | 2019 |
| An exponential lower bound for homogeneous depth-5 circuits over finite fields M Kumar, R Saptharishi arXiv preprint arXiv:1507.00177, 2015 | 25 | 2015 |
| Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits M Kumar, S Saraf Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 25 | 2014 |
| Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization M Kumar, S Mishra, NS Devi, S Saurabh Theoretical Computer Science 526, 90-96, 2014 | 23 | 2014 |
| Hardness-randomness tradeoffs for algebraic computation M Kumar, R Saptharishi Bulletin of EATCS 3 (129), 2019 | 21 | 2019 |
| Sums of products of polynomials in few variables: lower bounds and polynomial identity testing M Kumar, S Saraf arXiv preprint arXiv:1504.06213, 2015 | 21 | 2015 |
| Closure results for polynomial factorization CN Chou, M Kumar, N Solomon Theory of Computing 15 (1), 1-34, 2019 | 19 | 2019 |
| A quadratic lower bound for homogeneous algebraic branching programs M Kumar computational complexity 28, 409-435, 2019 | 19 | 2019 |
| Hardness vs randomness for bounded depth arithmetic circuits CN Chou, M Kumar, N Solomon 33rd Computational Complexity Conference (CCC 2018), 2018 | 19 | 2018 |
| Efficient indexing of necklaces and irreducible polynomials over finite fields S Kopparty, M Kumar, M Saks International Colloquium on Automata, Languages, and Programming, 726-737, 2014 | 19 | 2014 |
| Faster parameterized algorithms for deletion to split graphs E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan Scandinavian Workshop on Algorithm Theory, 107-118, 2012 | 19 | 2012 |
| The chasm at depth four, and tensor rank: Old results, new insights S Chillara, M Kumar, R Saptharishi, V Vinay arXiv preprint arXiv:1606.04200, 2016 | 16 | 2016 |
| Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity MA Forbes, M Kumar, R Saptharishi arXiv preprint arXiv:1605.04207, 2016 | 16 | 2016 |
