Comparisons between linear functions can help
From MaRDI portal
Publication:1170029
DOI10.1016/0304-3975(82)90041-XzbMath0496.68026MaRDI QIDQ1170029
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Selection problems via \(m\)-ary queries ⋮ Comparisons between linear functions can help ⋮ Lower bounds for sorting of sums ⋮ Decision trees: Old and new results.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
- Comparisons between linear functions can help
- A nonlinear lower bound on linear search tree programs for solving knapsack-problems
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
- On the complexity of computations under varying sets of primitives
- Proving simultaneous positivity of linear forms
- On the Polyhedral Decision Problem
- On Finding the Maxima of a Set of Vectors
- On the complexity of computing the measure of ∪[a i ,b i ]
This page was built for publication: Comparisons between linear functions can help
