On the complexity of computations under varying sets of primitives
Authors:
- David P. DobkinDDDavid P. Dobkin
- Richard J. LiptonRLRichard J. Lipton
- 1 February 1979
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 18 (1) , 86-91
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A lower bound of 12n2 on linear search programs for the Knapsack problemJournal of Computer and System Sciences, 1978
- A nonlinear lower bound on linear search tree programs for solving knapsack problemsJournal of Computer and System Sciences, 1976
- On some generalizations of binary search1974
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- Computing the maximum and the median1971