activity
20152021
most citedSome Lower Bound Results for Set-Multilinear Arithmetic Computations

2 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.CC2021★ 1 cited

On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits

S Raja, Sumukha Bharadwaj G

In this paper, we study the computational complexity of the commutative determinant polynomial computed by a class of set-multilinear circuits which we call regular set-multilinear…