Publisher
American Mathematical Society (AMS)
Subject
Applied Mathematics,Computational Mathematics,Algebra and Number Theory
Reference6 articles.
1. S. WINOGRAD, "Some bilinear forms whose multiplicative complexity depends on the field of constants," to be published in Mathematical Systems Theory, Vol. 10.
2. An algorithm for the machine calculation of complex Fourier series;Cooley, James W.;Math. Comp.,1965
3. C. M. FIDUCCIA & Y. ZALCSTEIN, Algebras Having Linear Multiplicative Complexities, Technical Report 46, Dept. of Computer Science, State University of New York, Stony Brook, August 1975.
4. The complexity of a scheme of functional elements simulating the multiplication of integers;Toom, A. L.;Dokl. Akad. Nauk SSSR,1963
5. C. M. RADER, "Discrete Fourier transforms when the number of data samples is prime," Proc. IEEE, v. 5, no. 6, June 1968, pp. 1107-1108.
Cited by
409 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献