A geometrical method in combinatorial complexity (Q3902478): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
label / en | label / en | ||
A geometrical method in combinatorial complexity | |||
Property / cites work | |||
Property / cites work: Q5608581 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of discrete programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note upon minimal path problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5655273 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4136563 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3226265 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time bounds for selection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sorting problem and its complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving Production Smoothing Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on Threshold Gate Realizability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5595900 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem / rank | |||
Normal rank | |||
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