The complexity of the characteristic and the minimal polynomial. (Q1401240)
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 1965274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the characteristic and the minimal polynomial. |
scientific article; zbMATH DE number 1965274 |
Statements
The complexity of the characteristic and the minimal polynomial. (English)
0 references
17 August 2003
0 references
Computational complexity
0 references
Logspace counting classes
0 references
Linear algebra
0 references
Characteristic polynomial
0 references
Minimal polynomial
0 references
Invariant factors
0 references
0.9259514212608336
0 references
0.8472132086753845
0 references
0.8111803531646729
0 references
