{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:18:32Z","timestamp":1787498312326,"version":"build-2736575974"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12981,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1016\/0012-365x(78)90097-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"261-276","source":"Crossref","is-referenced-by-count":22,"title":["Lower bounds on the worst-case complexity of some oracle algorithms"],"prefix":"10.1016","volume":"24","author":[{"given":"Dirk","family":"Hausmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernhard","family":"Korte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90097-3_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = ? NP Question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(78)90097-3_BIB2","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0012-365X(78)90097-3_BIB3","series-title":"Foundations of Modern Analysis","author":"Dieudonn\u00e9","year":"1969"},{"key":"10.1016\/0012-365X(78)90097-3_BIB4","first-page":"110","article-title":"On the complexity of computations under varying sets of primitives","author":"Dobkin","year":"1975","journal-title":"Proc. Second GI-Symposium on Automata Theory and Formal Languages"},{"key":"10.1016\/0012-365X(78)90097-3_BIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0022-0000(76)80051-7","article-title":"A nonlinear lower bound on linear search tree programs for solving knapsack problems","volume":"13","author":"Dobkin","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(78)90097-3_BIB6","series-title":"A short course in solving equations with PL homotopies","author":"Eaves","year":"1975"},{"key":"10.1016\/0012-365X(78)90097-3_BIB7","first-page":"137","article-title":"Oracle algorithms for fixed point problems\u2014an axiomatic approach","author":"Hausmann","year":"1978"},{"key":"10.1016\/0012-365X(78)90097-3_BIB8","first-page":"65","article-title":"An analysis of the greedy heuristic for independence systems","volume":"2","author":"Korte","year":"1978"},{"key":"10.1016\/0012-365X(78)90097-3_BIB9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/malq.19640100502","article-title":"Predictably computable functionals and definitions by recursion","volume":"10","author":"Kre?der","year":"1964","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/0012-365X(78)90097-3_BIB10","article-title":"Best algorithms for approximating the maximum of a submodular set function","author":"Nemhauser","year":"1976"},{"key":"10.1016\/0012-365X(78)90097-3_BIB11","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","article-title":"Proving simultaneous positivity of linear forms","volume":"6","author":"Rabin","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(78)90097-3_BIB12","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1137\/0115116","article-title":"The approximation of fixed points of a continuous mapping","volume":"15","author":"Scarf","year":"1967","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(78)90097-3_BIB13","unstructured":"C.P. Schnorr, A lower bound on the number of additions in monotone computations of monotone rational polynomials (Unpubl. manuscript)."},{"key":"10.1016\/0012-365X(78)90097-3_BIB14","series-title":"The Computation of Fixed Points and Applications","author":"Todd","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:21:55Z","timestamp":1555140115000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78900973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78900973"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90097-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}