Lower bounds on the worst-case complexity of some oracle algorithms
- 31 December 1978
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 24 (3), 261-276
- https://doi.org/10.1016/0012-365x(78)90097-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A nonlinear lower bound on linear search tree programs for solving knapsack problemsJournal of Computer and System Sciences, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- The Approximation of Fixed Points of a Continuous MappingSIAM Journal on Applied Mathematics, 1967
- PREDICTABLY COMPUTABLE FUNCTIONALS AND DEFINITION BY RECURSIONMathematical Logic Quarterly, 1964