The effect of the field of constants on the number of multiplications

@article{Winograd1975TheEO,
title={The effect of the field of constants on the number of multiplications},
author={S. Winograd},
journal={16th Annual Symposium on Foundations of Computer Science (sfcs 1975)},
year={1975},
pages={1-2}
}

16th Annual Symposium on Foundations of Computer Science (sfcs 1975)

New algorithms for computing the Discrete Fourier Transform of n points are described. For n in the range of a few tens to a few thousands these algorithms use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions. Computing the Discrete Fourier Transform (DFT) of n points: n-1 2vt Aj = wiiai, j ... ,n -1, w= e [1]