On computing the determinant in small parallel time using a small number of processors (Q794429): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60164650, #quickstatements; #temporary_batch_1711504555137 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Prefix Computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Method of Determining Explicitly the Coefficients of the Characteristic Equation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank | |||
Normal rank | |||
Latest revision as of 12:07, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the determinant in small parallel time using a small number of processors |
scientific article |
Statements
On computing the determinant in small parallel time using a small number of processors (English)
0 references
1984
0 references
parallel algebraic circuit complexity
0 references
upper bounds
0 references
matrix
0 references
determinant
0 references
characteristic polynomial
0 references
adjoint
0 references
commutative ring
0 references
Turing machine
0 references
