1 citations · 1 across the 1 of their papers we have counts for
2 papers
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…
cs.CC2016
Randomized Polynomial Time Identity Testing for Noncommutative Circuits
V. Arvind, Partha Mukhopadhyay, S. Raja
In this paper we show that the black-box polynomial identity testing for noncommutative polynomials of degree and sparsity $t…