A geometrical method in combinatorial complexity (Q3902478): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A geometrical method in combinatorial complexity | |||
| Property / DOI | |||
| Property / DOI: 10.21136/am.1981.103900 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2735507719 / rank | |||
Normal rank | |||
| Property / title | |||
A geometrical method in combinatorial complexity (English) | |||
| Property / title: A geometrical method in combinatorial complexity (English) / rank | |||
Normal rank | |||
Latest revision as of 11:17, 30 July 2024
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
