Parameterized complexity of sparse linear complementarity problems (Q2408196)
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: Parameterized complexity of sparse linear complementarity problems |
scientific article; zbMATH DE number 6788871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of sparse linear complementarity problems |
scientific article; zbMATH DE number 6788871 |
Statements
Parameterized complexity of sparse linear complementarity problems (English)
0 references
10 October 2017
0 references
linear complementarity problem
0 references
sparsity
0 references
parameterized complexity
0 references
0 references
0 references
0.9999999
0 references
0 references
0.9209549
0 references
0 references
0.90087044
0 references
0 references
0.8991897
0 references
0.8964639
0 references
0.8964639
0 references
