Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
Paper
On computing the discrete fourier transform
Abstract
A new algorithm for computing the Discrete Fourier Transform is described. The algorithm is based on a recent result in complexity theory which enables us to derive efficient algorithms for convolution. These algorithms are then used to obtain the new Discrete Fourier Transform algorithm. © 1978 American Mathematical Society.
Related
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics