Comparisons between linear functions can help
type: Item
instance of: scholarly article
title: Comparisons between linear functions can help
zbMATH Open document ID: 0496.68026
DOI: 10.1016/0304-3975(82)90041-X
author: Marc Snir
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3782378
zbMATH Keywords: worst case behavior of decision algorithms
zbMATH Keywords: linear forms
zbMATH Keywords: linear decision trees
MaRDI profile type: Publication
cites work: A nonlinear lower bound on linear search tree programs for solving knapsack-problems
cites work: A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
cites work: On the complexity of computations under varying sets of primitives
cites work: On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
cites work: On the complexity of computing the measure of ∪[a i ,b i ]
cites work: Q5547252
cites work: Q3245642
cites work: Q4057549
cites work: On Finding the Maxima of a Set of Vectors
cites work: Proving simultaneous positivity of linear forms
cites work: Q3926036
cites work: On the Polyhedral Decision Problem
description: scientific article; zbMATH DE number 3782378