Triple
T14984174
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cooley–Tukey Fast Fourier Transform algorithm |
E373658
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object |
mixed-radix Cooley–Tukey FFT
The mixed-radix Cooley–Tukey FFT is a variant of the Fast Fourier Transform algorithm that efficiently computes discrete Fourier transforms by factoring the transform size into a product of smaller, not-necessarily-equal radices.
|
E373658
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d85ccc84388190aa151e5173370c8d |
elicitation | completed |
| NER | batch_69ded6ff4a7c8190ab7554f3a1a09b67 |
ner | completed |
| NED1 | batch_69fe9694aa688190bbecb645c49e795e |
ned_source_triple | completed |
| NED2 | batch_69fe99a856e48190a44548d756737164 |
ned_description | completed |
| NEDg | batch_69fe99553b3c8190b6bf3e133a2772fa |
nedg | completed |
Created at: April 10, 2026, 2:52 a.m.