div class=trans-pagebutton class=gotoPage data-page=1Page 1button div class=trans-imagea href=https:reader043fdocumentsinreader043viewer20220404225e108f74cd608b0a44685676html5page1jpg target=_blank img data-url=documentalgorithm-is-known-as-the-good-thomas-fft-for-elementary-abelian-2-groups-g-ghtmlpage=1 data-page=1 class=trans-thumb lazyload alt=Page 1: theorycsuni-bonndetheorycsuni-bonndeftpreportscs-reports19908550-CSpdfThis algorithm is known as the Good-Thomas-FFT For elementary abelian 2-groups G = G repeated application loading=lazy src=data:imagegifbase64iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAQAAAC1HAwCAAAAC0lEQVR42mM8Uw8AAh0BTZud3BwAAAAASUVORK5CYII= data-src=https:reader043fdocumentsinreader043viewer20220404225e108f74cd608b0a44685676html5thumbnails1jpg width=140 height=200 adivdivdiv class=trans-pagebutton class=gotoPage data-page=2Page 2button div class=trans-imagea href=https:reader043fdocumentsinreader043viewer20220404225e108f74cd608b0a44685676html5page2jpg target=_blank img data-url=documentalgorithm-is-known-as-the-good-thomas-fft-for-elementary-abelian-2-groups-g-ghtmlpage=2 data-page=2 class=trans-thumb lazyload alt=Page 2: theorycsuni-bonndetheorycsuni-bonndeftpreportscs-reports19908550-CSpdfThis algorithm is known as the Good-Thomas-FFT For elementary abelian 2-groups G = G repeated application loading=lazy src=data:imagegifbase64iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAQAAAC1HAwCAAAAC0lEQVR42mM8Uw8AAh0BTZud3BwAAAAASUVORK5CYII= data-src=https:reader043fdocumentsinreader043viewer20220404225e108f74cd608b0a44685676html5thumbnails2jpg width=140 height=200 adivdivdiv class=trans-pagebutton class=gotoPage data-page=3Page 3button div class=trans-imagea href=https:reader043fdocumentsinreader043viewer20220404225e108f74cd608b0a44685676html5page3jpg target=_blank img data-url=documentalgorithm-is-known-as-the-good-thomas-fft-for-elementary-abelian-2-groups-g-ghtmlpage=3 data-page=3 class=trans-thumb lazyload alt=Page 3:...