A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On computing the determinant in small parallel time using a small number of processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast parallel matrix and GCD computations / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579205 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2610884651 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast parallel algorithm to compute the rank of a matrix over an arbitrary field |
scientific article |
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
