Computational complexity of LCPs associated with positive definite symmetric matrices (Q3854941)
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: Computational complexity of LCPs associated with positive definite symmetric matrices |
scientific article; zbMATH DE number 3655692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of LCPs associated with positive definite symmetric matrices |
scientific article; zbMATH DE number 3655692 |
Statements
Computational complexity of LCPs associated with positive definite symmetric matrices (English)
0 references
1979
0 references
positive definite symmetric matrices
0 references
linear complementarity
0 references
P-matrix
0 references
Lemke's algorithm
0 references
Gray code
0 references
0 references
