Communication complexity of matrix computation over finite fields
Authors:
- 1 May 1995
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 28 (3) , 215-228
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The communication complexity of several problems in matrix computationJournal of Complexity, 1991
- On modulus replication for residue arithmetic computations of complex inner productsIEEE Transactions on Computers, 1990
- Lattices, mobius functions and communications complexity1988
- Unbiased bits from sources of weak randomness and probabilistic communication complexity1985
- A Combinatorial Limit to the Computing Power of VLSI CircuitsIEEE Transactions on Computers, 1983
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- Area-time complexity for VLSI1979
- Fast Convolution using fermat number transforms with applications to digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Effects of finite register length in digital filtering and the fast Fourier transformProceedings of the IEEE, 1972
- The fast Fourier transform in a finite fieldMathematics of Computation, 1971