A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640)
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 4034991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast parallel algorithm to compute the rank of a matrix over an arbitrary field |
scientific article; zbMATH DE number 4034991 |
Statements
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (English)
0 references
1987
0 references
It is shown that the rank of a matrix can be computed in \(O(\log^ 2n)\) time using \(O(n^{4.5})\) processors, referring to a result of Borodin et al.
0 references
parallel complexity
0 references
rank of a matrix
0 references
0.89988184
0 references
0.89988184
0 references
0.8885016
0 references
0.88806796
0 references
0.87367606
0 references
