A geometrical method in combinatorial complexity (Q3902478)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A geometrical method in combinatorial complexity |
scientific article |
Statements
1981
0 references
lower bound for the number of comparisons
0 references
knapsack problem
0 references
decomposition of polyhedral sets into convex sets
0 references
A geometrical method in combinatorial complexity (English)
0 references
