@MISC{POLYNOM8.MIZ,
  AUTHOR = {Treyderowski, Krzysztof and Schwarzweller, Christoph},
  TITLE = {Multiplication of Polynomials 
     using {D}iscrete {F}ourier {T}ransformation},
  SECTION1 = {Preliminaries},
  SECTION2 = {Multiplication of Algegraic Sequences},
  SECTION3 = {Powers in Double Loop Structures},
  SECTION4 = {Conversion between Algebraic Sequences and Matrices},
  SECTION5 = {Primitive Roots, DFT and Vandermonde Matrix},
  SECTION6 = {DFT-Multiplication of Polynomials},
  DAY = {12},
  MONTH = {October},
  YEAR = {2006},
  ADDRESS1 = {Department of Computer Science\\University of Gda\'{n}sk\\Wita Stwosza 57, 80-952 Gda\'{n}sk, Poland},
  ADDRESS2 = {Department of Computer Science\\University of Gda\'{n}sk\\Wita Stwosza 57, 80-952 Gda\'{n}sk, Poland},
  SUMMARY = {In this article we define the Discrete Fourier Transformation 
  for univariate polynomials and show that multiplication of 
  polynomials can be carried out by two Fourier Transformations 
  with a vector multiplication in-between. Our proof follows the 
  standard one found in the literature and uses Vandermonde matrices, 
  see e.g. \cite{ModernComputerAlgebra}.}}

