Nearly Optimal Sparse Fourier Transform Haitham Hassanieh MIT Piotr Indyk MIT

First Page		Document Content
Date: 2012-07-08 20:42:16 Fourier analysis Analysis of algorithms Digital signal processing Joseph Fourier Unitary operators Fast Fourier transform Discrete Fourier transform Fourier transform Big O notation Mathematical analysis Mathematics Theoretical computer science		Nearly Optimal Sparse Fourier Transform Haitham Hassanieh MIT Piotr Indyk MIT Add to Reading List Source URL: people.csail.mit.edu Download Document from Source Website File Size: 411,06 KB Share Document on Facebook

	Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen Po-Chun Kuo DocID: 1xVYf - View Document
	Polynomials and the Fast Fourier Transform (FFT) DocID: 1xUw0 - View Document
	Lecture 20, Tues April 4: Shor, Quantum Fourier Transform Last time we started in on Shor’s algorithm, a quantum algorithm that can factor N into p×q in polynomial time by reducing the problem to per DocID: 1xTSU - View Document
	Lecture IX: Fourier transform Maxim Raginsky BME 171: Signals and Systems Duke University October 8, 2008 DocID: 1uYub - View Document
	QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday August 30, 2011 (DayLet f be a differentiable function on R whose Fourier transform is bounded DocID: 1uS2D - View Document