On the complexity of computing determinants (Q1766817): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56459440, #quickstatements; #temporary_batch_1719524507666 |
Created claim: DBLP publication ID (P1635): journals/cc/KaltofenV05, #quickstatements; #temporary_batch_1731483406851 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/cc/KaltofenV05 / rank | |||
Normal rank | |||
Revision as of 08:54, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing determinants |
scientific article |
Statements
On the complexity of computing determinants (English)
0 references
1 March 2005
0 references
Integer matrix
0 references
matrix determinant
0 references
characteristic polynomial
0 references
Smith normal form
0 references
bit complexity
0 references
division-free complexity
0 references
randomized algorithm
0 references
multivariable control theory
0 references
realization
0 references
matrix sequence
0 references
block Wiedemann algorithm
0 references
block Lanczos algorithm
0 references
