1 citations · 1 across the 1 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2009
On the hardness of the noncommutative determinant
V. Arvind, Srikanth Srinivasan
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutative…
cs.CC2008★ 1 cited
New results on Noncommutative and Commutative Polynomial Identity Testing
V. Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
Using ideas from automata theory we design a new efficient (deterministic) identity test for the \emph{noncommutative} polynomial identity testing problem (first introduced and stu…