scientific article; zbMATH DE number 1760022
From MaRDI portal
Publication:4536950
Recommendations
- Communication code generation in systems of affine recurrence equations
- On the Communication Complexity of Solving a Polynomial Equation
- The communication complexity of several problems in matrix computation
- Minimizing communication in numerical linear algebra
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Linear algebraic methods in communication complexity
- Randomized communication complexity for linear algebra problems over finite fields
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536950)