Lower bound arguments with “Inaccessible” numbers
- 1 June 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 36 (3) , 313-335
- https://doi.org/10.1016/0022-0000(88)90032-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Lower bounds for solving linear diophantine equations on random access machinesJournal of the ACM, 1985
- Trade-Offs between Depth and Width in Parallel ComputationSIAM Journal on Computing, 1985
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack ProblemJournal of the ACM, 1984
- Simulation of Parallel Random Access Machines by CircuitsSIAM Journal on Computing, 1984
- Exponential lower bounds for some NP-complete problems in a restricted linear decision tree modelBIT Numerical Mathematics, 1983
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- A lower bound of 12n2 on linear search programs for the Knapsack problemJournal of Computer and System Sciences, 1978