Checking robust nonsingularity is NP-hard (Q1802197)
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: Checking robust nonsingularity is NP-hard |
scientific article; zbMATH DE number 202973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Checking robust nonsingularity is NP-hard |
scientific article; zbMATH DE number 202973 |
Statements
Checking robust nonsingularity is NP-hard (English)
0 references
26 January 1994
0 references
robust nonsingularity
0 references
interval matrices
0 references
radius of nonsingularity
0 references
0 references
0.868543803691864
0 references
0.8235538005828857
0 references
0.8095163702964783
0 references
0.8095163702964783
0 references
