Problemcore
Discrete Fourier transform
Also called DFT.
Given a_0..a_{n-1}, compute A_k = sum_j a_j w^{jk}; naive cost is Theta(n^2).
Given a_0..a_{n-1}, compute A_k = sum_j a_j w^{jk}; naive cost is Theta(n^2).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 6GT3DW Edit this page History Report an error