2 citations · 3 across the 6 of their papers we have counts for
6 papers
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…
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings
V. Arvind, Rajit Datta, Partha Mukhopadhyay +1
In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring . Prior to this work, nonassociative…
Identity Testing for +-Regular Noncommutative Arithmetic Circuits
Vikraman Arvind, Pushkar Joglekar, Partha Mukhopadhyay +1
An efficient randomized polynomial identity test for noncommutative polynomials given by noncommutative arithmetic circuits remains an open problem. The main bottleneck to applying…
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…
Some Lower Bound Results for Set-Multilinear Arithmetic Computations
V. Arvind, S. Raja
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natu…
Noncommutative Valiant's Classes: Structure and Complete Problems
V. Arvind, Pushkar S Joglekar, S. Raja
In this paper we explore the noncommutative analogues, and , of Valiant's algebraic complexity classes and show some striking connections to c…