The communication complexity of several problems in matrix computation (Q1186508): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Area-Time Complexity of Binary Multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A model of computation for VLSI with related complexity results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Information Transfer in Distributed Computing with Applications to VLSI / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Area-period tradeoffs for multiplication of rectangular matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Area-time tradeoffs for matrix multiplication and related problems in VLSI models / rank | |||
Normal rank | |||
Revision as of 17:06, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The communication complexity of several problems in matrix computation |
scientific article |
Statements
The communication complexity of several problems in matrix computation (English)
0 references
28 June 1992
0 references
communication complexity
0 references
singularity testing
0 references
rank
0 references
determinant
0 references
matrix decompositions
0 references
solvability of systems of linear equations
0 references
