On the complexity of computing determinants (Q1766817)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of computing determinants |
scientific article; zbMATH DE number 2140063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing determinants |
scientific article; zbMATH DE number 2140063 |
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
0.8271862268447876
0 references
