2 papers
cs.CC2009
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…
cs.CC2008
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…