Strong NP-completeness of a matrix similarity problem (Q671534)
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: Strong NP-completeness of a matrix similarity problem |
scientific article; zbMATH DE number 983357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong NP-completeness of a matrix similarity problem |
scientific article; zbMATH DE number 983357 |
Statements
Strong NP-completeness of a matrix similarity problem (English)
0 references
27 February 1997
0 references
computational complexity
0 references
similarity transformation
0 references
condition number
0 references
0 references
0 references
0.810621976852417
0 references
0.7577000260353088
0 references
