<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2010-07-08 18:30:58Generalized functions Smooth functions Integral transforms Convolution Distribution Bounded variation Mollifier Fourier transform Banach space Mathematical analysis Functional analysis Fourier analysis |
Add to Reading List |
Convolutions with the continuous primitive integral | Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen Po-Chun KuoDocID: 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 perDocID: 1xTSU - View Document |
| Lecture IX: Fourier transform Maxim Raginsky BME 171: Signals and Systems Duke University October 8, 2008DocID: 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 boundedDocID: 1uS2D - View Document |