Mrinal Kumar

activity

20132026

most citedAn exponential lower bound for homogeneous depth-5 circuits over finite fields

11 citations · 66 across the 33 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.CC2016★ 9 cited

The Chasm at Depth Four, and Tensor Rank : Old results, new insights

Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi +1

Agrawal and Vinay [AV08] showed how any polynomial size arithmetic circuit can be thought of as a depth four arithmetic circuit of subexponential size. The resulting circuit size i…

cs.CC2016

Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity

Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi

We say that a circuit $C$ over a field $F$ functionally computes an $n$ -variate polynomial $P$ if for every $x \in {0, 1}^{n}$ we have that $C (x) = P (x)$ . This is in contrast to syn…