11 citations · 66 across the 33 of their papers we have counts for
45 papers
A Quadratic Lower Bound on Determinantal Complexity
Mrinal Kumar, Ben Lee Volk
We prove an lower bound on the determinantal complexity of the power sum polynomial over the field of complex numbers. A similar result was claimed in…
Advances in List Decoding of Polynomial Codes
Mrinal Kumar, Noga Ron-Zewi
Error-correcting codes are a method for representing data, so that one can recover the original information even if some parts of it were corrupted. The basic idea, which dates bac…
Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
Rohan Goyal, Prahladh Harsha, Mrinal Kumar +1
A recent work of Goyal, Harsha, Kumar and Shankar gave nearly linear time algorithms for the list decoding of Folded Reed-Solomon codes (FRS) and univariate multiplicity codes up t…
Deterministic list decoding of Reed-Solomon codes
Soham Chatterjee, Prahladh Harsha, Mrinal Kumar
We show that Reed-Solomon codes of dimension and block length over any finite field can be deterministically list decoded from agreement in tim…
Modular composition & polynomial GCD in the border of small, shallow circuits
Robert Andrews, Mrinal Kumar, Shanthanu S. Rai
Modular composition is the problem of computing the coefficient vector of the polynomial , given as input the coefficient vectors of univariate polynomials ,…
Constant-depth circuits for polynomial GCD over any characteristic
Somnath Bhattacharjee, Mrinal Kumar, Shanthanu Rai +3
We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regar…