Lower bound of DFT

From: Piotr Wyderski (wyderskiREMOVE_at_ii.uni.wroc.pl)
Date: 02/22/05 

Date: Tue, 22 Feb 2005 19:03:57 +0100

Hello,

has it been proven that the lower bound of Discrete Fourier Transform
is Omega(n log n)? I'm looking for such a proof, but I can't find any
-- so, is it still an open problem? :-)

    Best regards
    Piotr Wyderski