Can the fast Fourier transform be computed in o(n log n) time?

Open the “Other algorithmic problems” section on Wikipedia →

Source: List of unsolved problems in computer science (CC BY-SA 4.0)