On the complexity of computing the handicap of a sufficient matrix (Q644911): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:47, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing the handicap of a sufficient matrix |
scientific article |
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
