Searching for "Complexity of Parallel Matrix Computations." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Parallel algorithms for solving aggregated shortest path problems. The
by H. Edwin Romeijn, Robert L. Smith — 1999 — Computers and Operations Research
…(N log N), by using N 2 processors. The complexity of parallel-matrix computation can be reduced to O…
Cited by 8 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB