✦ LIBER ✦

A note on the computational complexity of the arithmetic Fourier transform

✍ Scribed by Tepedelenlioglu, N.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on, "A note on the computationa

✍ Tufts, D.W. 📂 Article 📅 1989 🏛 IEEE ⚖ 143 KB

Note on the Fast Fourier Transform

✍ RIGLER, A. K. 📂 Article 📅 1968 🏛 Optical Society of America ⚖ 564 KB

A summability method for the arithmetic

✍ W. J. Walker 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 308 KB

A note on the multiple scale Fourier tra

✍ A. Jeffrey; T. Kawahara 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 562 KB

The multiplicative complexity of the Dis

✍ L Auslander; E Feig; S Winograd 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 910 KB

A note on the computational complexity o

✍ Giunta, G. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 200 KB