On the limits of computations with the floor function
- 1 August 1988
- journal article
- Published by Elsevier in Information and Computation
- Vol. 78 (2) , 99-107
- https://doi.org/10.1016/0890-5401(88)90031-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Lower bounds for solving linear diophantine equations on random access machinesJournal of the ACM, 1985
- Lower time bounds for integer programming with two variablesInformation Processing Letters, 1985
- A lower time bound for the knapsack problem on random access machinesActa Informatica, 1983
- A lower bound of 12n2 on linear search programs for the Knapsack problemJournal of Computer and System Sciences, 1978