The communication complexity of several problems in matrix computation
From MaRDI portal
Publication:1186508
DOI10.1016/0885-064X(91)90027-UzbMath0768.68036MaRDI QIDQ1186508
Publication date: 28 June 1992
Published in: Journal of Complexity (Search for Journal in Brave)
rank; determinant; communication complexity; matrix decompositions; singularity testing; solvability of systems of linear equations
68Q25: Analysis of algorithms and problem complexity
65Y05: Parallel numerical computation
65F40: Numerical computation of determinants
65Y20: Complexity and performance of numerical algorithms
Related Items
Cites Work
- Area-period tradeoffs for multiplication of rectangular matrices
- Area-time tradeoffs for matrix multiplication and related problems in VLSI models
- Information Transfer in Distributed Computing with Applications to VLSI
- A model of computation for VLSI with related complexity results
- The Area-Time Complexity of Binary Multiplication