A Class of Finite Computations Structures Supporting the Fast Fourier Transform
| dc.contributor.author | Bonneau, Richard J. | en_US |
| dc.date.accessioned | 2023-03-29T14:03:16Z | |
| dc.date.available | 2023-03-29T14:03:16Z | |
| dc.date.issued | 1973-03 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148860 | |
| dc.description.abstract | The Fast Fourier Transform (FFT) and modular arithmetic are two distinct techniques which recently have been employed to increase the efficiency of numerous algorithms in the area of symbolic and algebraic manipulation. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-031 | |
| dc.relation.ispartofseries | MAC-TM-031 | |
| dc.title | A Class of Finite Computations Structures Supporting the Fast Fourier Transform | en_US |
| dc.identifier.oclc | 10254232 |
