The P-matrix problem is co-NP-complete (Q1330899)
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 617336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The P-matrix problem is co-NP-complete |
scientific article; zbMATH DE number 617336 |
Statements
The P-matrix problem is co-NP-complete (English)
0 references
10 August 1994
0 references
linear complementarity
0 references
interval matrices
0 references
NP-complete
0 references
P-matrix
0 references
0.8464961051940918
0 references
0.8209721446037292
0 references
0.8199008107185364
0 references
0.8095163702964783
0 references
0.7877983450889587
0 references
