Pages that link to "Item:Q1186508"
From MaRDI portal
The following pages link to The communication complexity of several problems in matrix computation (Q1186508):
Displaying 8 items.
- Best-order streaming model (Q534570) (← links)
- On the complexity of decomposing matrices arising in satellite communication (Q1060960) (← links)
- Communication complexity of the Gaussian elimination algorithm on multiprocessors (Q1077125) (← links)
- Still another rank determination of set intersection matrices with an application in communication complexity (Q1324468) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- Randomized communication complexity for linear algebra problems over finite fields (Q2904786) (← links)
- (Q4536950) (← links)
- Communication complexity of matrix computation over finite fields (Q4835864) (← links)