The communication complexity of several problems in matrix computation

DOI10.1016/0885-064X(91)90027-UzbMath0768.68036OpenAlexW2086459568MaRDI QIDQ1186508

Jeff I. Chu, Georg Schnitger

Publication date: 28 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(91)90027-u

zbMATH Keywords

rankdeterminantcommunication complexitymatrix decompositionssingularity testingsolvability of systems of linear equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Communication complexity of matrix computation over finite fields ⋮ Best-order streaming model

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

This page was built for publication: The communication complexity of several problems in matrix computation