COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME (Q4853329)
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 810149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME |
scientific article; zbMATH DE number 810149 |
Statements
COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME (English)
0 references
29 October 1995
0 references
algebraic extension field
0 references
polynomial time algorithms
0 references
Jordan normal form
0 references
0.7639897465705872
0 references
0.7500523924827576
0 references
0.7492568492889404
0 references
