Searching for "Nearly Sharp Complexity Bounds for Multiprocessor Algebraic 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.

Nearly Sharp Complexity Bounds For Multiprocessor Algebraic Computations
by Dima Grigoriev — 1997 — J. Complexity
…NEARLY SHARP COMPLEXITY BOUNDS FOR MULTIPROCESSOR ALGEBRAIC COMPUTATIONS Dima Grigoriev…
Cited by 7 (4 self) – Add To MetaCart

Showing 1 through 1.

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