2 citations · 3 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 2 cited
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…
cs.CC2015
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…