Oracle computations in parallel numerical linear algebra (Q1325837)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 567718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Oracle computations in parallel numerical linear algebra |
scientific article; zbMATH DE number 567718 |
Statements
Oracle computations in parallel numerical linear algebra (English)
0 references
30 October 1994
0 references
Using a new notion of reducibility, the authors investigate the behaviour of several known reductions among important problems in linear algebra. The main concern is the relative parallel-time complexity of certain problems within the class NC. It is shown that, within the computational model considered, many known reduction algorithms do not extend whereas the extension of other ones requires additional care.
0 references
oracle computations
0 references
parallel algorithms
0 references
reducibility
0 references
parallel-time complexity
0 references
reduction algorithms
0 references
0.8672012686729431
0 references
0.7599117755889893
0 references
0.7544946074485779
0 references
0.7519359588623047
0 references
