1 citations · 1 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020
A Lower Bound on Determinantal Complexity
Mrinal Kumar, Ben Lee Volk
The determinantal complexity of a polynomial over a field is the dimension of the smallest matrix whose entries are affine fun…
cs.CC2020
A Polynomial Degree Bound on Equations of Non-rigid Matrices and Small Linear Circuits
Mrinal Kumar, Ben Lee Volk
We show that there is a defining equation of degree at most for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large…