Searching for "Parallel Complexity of Matrix Multiplication." – sorted by Relevance.
-
New Deterministic Parallel Algorithms for the Characteristic Polynomial of a Matrix over Abstract
- related to the complexity, M(n), of n \Theta n matrix multiplication, M(n) = \Omega\Gamma n 2 ), M
- Cited by 1 (0 self) – Add To MetaCart

