#### Filter Results:

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Nir Ailon, Gal Yehuda
- ArXiv
- 2016

The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies numerical ill-condition. The papers also quantify this tradeoff. The main method for proving these results is via a potential… (More)

- Gal Yehuda
- 2016

This notes cover dimensionality reduction of the linear regression problem using subspace embedding, and background for the streaming JL problem. The linear regression problem is defined as follows: Given a matrix A ∈ R n×d and a vector b ∈ R n , find x such that: x = argmin x∈R d Ax − b 2. In this case, a closed formula is known for x : x = (A T A) −1 A T… (More)

- ‹
- 1
- ›