2 citations · 2 across the 4 of their papers we have counts for
4 papers · 1 filter
Matrix Polynomial Factorization via Higman Linearization
V. Arvind, Pushkar S. Joglekar
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1)…
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…
On Lower Bounds for Constant Width Arithmetic Circuits
V. Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polyn…
Lattice Problems, Gauge Functions and Parameterized Algorithms
V. Arvind, Pushkar S. Joglekar
Given a k-dimensional subspace M\subseteq \R^n and a full rank integer lattice L\subseteq \R^n, the \emph{subspace avoiding problem} SAP is to find a shortest vector in L\setminus…