3 citations · 7 across the 11 of their papers we have counts for
1 paper · 1 filter
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…