NP-completeness of the linear complementarity problem (Q1095806)
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: NP-completeness of the linear complementarity problem |
scientific article; zbMATH DE number 4029285
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of the linear complementarity problem |
scientific article; zbMATH DE number 4029285 |
Statements
NP-completeness of the linear complementarity problem (English)
0 references
1989
0 references
We consider the linear complementarity problem (q,M) for which the data is the integer column vector \(q\in R^ n\) and the integer square matrix M of order n. GLCP is the decision problem: Does (q,M) have a solution? We show that GLCP is NP-complete in the strong sense.
0 references
NP-completeness in the strong sense
0 references
0-1 knapsack problems
0 references
linear complementarity
0 references
