Abstract
Given an arbitrary matrix $A\in\mathbb{R}^{m\times n}$, we consider the fundamental problem of computing $Ax$ for any $x\in\mathbb{R}^n$ such that $Ax$ is $s$-sparse. While fast algorithms exist fo...
Funding Information
  • Air Force Office of Scientific Research (FA9550-18-1-0107)
  • Deutsche Forschungsgemeinschaft (KR 4512/2-2, GR4334/1-1)
  • National Science Foundation (DMS-1829955)

This publication has 39 references indexed in Scilit: