NP-completeness of the linear complementarity problem (Q1095806): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4101610 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational complexity of complementary pivot methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: `` Strong '' NP-Completeness Results / rank | |||
Normal rank | |||
Latest revision as of 13:40, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of the linear complementarity problem |
scientific article |
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
