Lower bounds on the worst-case complexity of some oracle algorithms
type: Item
instance of: scholarly article
title: Lower bounds on the worst-case complexity of some oracle algorithms
zbMATH Open document ID: 0392.68036
DOI: 10.1016/0012-365X(78)90097-3
author: Dirk Hausmann
author: Bernhard Korte
published in: Discrete Mathematics
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3609130
zbMATH Keywords: Oracle Algorithms
zbMATH Keywords: Lower Bounds
zbMATH Keywords: Independence Systems
zbMATH Keywords: Worst-Case Complexity
zbMATH Keywords: Fixed-Point Problems for Continuous Functions
zbMATH Keywords: Optimization Problems
MaRDI profile type: Publication
cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
cites work: Q4138187
cites work: Q5565769
cites work: Q4080721
cites work: A nonlinear lower bound on linear search tree programs for solving knapsack-problems
cites work: Q4112523
cites work: Q4190051
cites work: An Analysis of the Greedy Heuristic for Independence Systems
cites work: PREDICTABLY COMPUTABLE FUNCTIONALS AND DEFINITION BY RECURSION
cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function
cites work: Proving simultaneous positivity of linear forms
cites work: The Approximation of Fixed Points of a Continuous Mapping
cites work: A lower bound on the number of additions in monotone computations
cites work: Extensions of Lemke's algorithm for the linear complementarity problem
description: scientific article; zbMATH DE number 3609130