Lower time bounds for integer programming with two variables
- 16 August 1985
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 21 (2) , 101-105
- https://doi.org/10.1016/0020-0190(85)90042-0
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- A lower time bound for the knapsack problem on random access machinesActa Informatica, 1983