Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Finite Fourier transform 3 found (10 total)

alternate case: finite Fourier transform

Louis Auslander (562 words) [view diff] exact match in snippet view article find links to article

S2CID 122009744. Auslander, L.; Tolimieri, R. (1979). "Is computing the finite Fourier transform pure or applied mathematics?". Bulletin of the American Mathematical
List of terms relating to algorithms and data structures (3,135 words) [view diff] exact match in snippet view article find links to article
tree Fibonacci heap Find find kth least element finitary tree finite Fourier transform (discrete Fourier transform) finite-state machine finite state
Redheffer matrix (6,249 words) [view diff] no match in snippet view article find links to article
the Mobius function through its representation as a discrete (finite) Fourier transform: μ ( n ) = ∑ gcd ( k , n ) = 1 1 ≤ k ≤ n e 2 π i k n . {\displaystyle