Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
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.
Igor Devetak, Andreas Winter
ISIT 2003
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
James Lee Hafner
Journal of Number Theory