Lower bounds for sorting of sums
- 20 August 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 66 (2) , 137-155
- https://doi.org/10.1016/0304-3975(89)90132-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Lower bound arguments with “Inaccessible” numbersJournal of Computer and System Sciences, 1988
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack ProblemJournal of the ACM, 1984
- Balancing poset extensionsOrder, 1984
- Exponential lower bounds for some NP-complete problems in a restricted linear decision tree modelBIT Numerical Mathematics, 1983
- Comparisons between linear functions can helpTheoretical Computer Science, 1982
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976