On the complexity of computing the handicap of a sufficient matrix (Q644911)
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 5968808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing the handicap of a sufficient matrix |
scientific article; zbMATH DE number 5968808 |
Statements
On the complexity of computing the handicap of a sufficient matrix (English)
0 references
7 November 2011
0 references
handicap of a sufficient matrix
0 references
linear complementarity problem (LCP)
0 references
semidefinite programming
0 references
0 references
0.9070324897766112
0 references
0.9070324897766112
0 references
0.7909630537033081
0 references
0.7730368971824646
0 references
