Comparisons between linear functions can help
- 30 September 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 19 (3) , 321-330
- https://doi.org/10.1016/0304-3975(82)90041-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Polyhedral Decision ProblemSIAM Journal on Computing, 1980
- On the Ω(n log n) lower bound for convex hull and maximal vector determinationInformation Processing Letters, 1980
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- 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 Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- Computing the maximum and the medianPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971