{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T05:25:43Z","timestamp":1734153943959,"version":"3.30.2"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00426-2","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T16:31:46Z","timestamp":1062606706000},"page":"355-363","source":"Crossref","is-referenced-by-count":1,"title":["On the complexity of finding a local maximum of functions on discrete planar subsets"],"prefix":"10.1016","volume":"310","author":[{"given":"Anton","family":"Mityagin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00426-2_BIB1","unstructured":"L. Beklemishev, On the induction schema for decidable predicates, Department of Philosophy, Utrecht University, Logic Group preprint series, 2000."},{"key":"10.1016\/S0304-3975(03)00426-2_BIB2","doi-asserted-by":"crossref","unstructured":"M. Blum, R. Impagliazzo, General oracle and oracle classes, 28th Ann. IEEE Symp. on Foundation of Computer Science, 1987, pp. 118\u2013126.","DOI":"10.1109\/SFCS.1987.30"},{"key":"10.1016\/S0304-3975(03)00426-2_BIB3","doi-asserted-by":"crossref","unstructured":"P. Crescenzi, R. Silvestri, Sperner's lemma and robust machines, Eighth Ann. Struct. in Complexity Theory Conf., 1993, pp. 194\u2013199.","DOI":"10.1109\/SCT.1993.336527"},{"key":"10.1016\/S0304-3975(03)00426-2_BIB4","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, M. Naor, Decision trees and downward closures, Third Ann. Conf. on Structure in Complexity Theory, 1988, pp. 29\u201338.","DOI":"10.1109\/SCT.1988.5260"},{"key":"10.1016\/S0304-3975(03)00426-2_BIB5","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1090\/S0002-9939-1953-0055639-3","article-title":"Sequential minimax search for a maximum","volume":"4","author":"Kiefer","year":"1953","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(03)00426-2_BIB6","doi-asserted-by":"crossref","unstructured":"L. Lovasz, M. Naor, I. Newman, A. Wigderson, Search problems in the decision tree model, 32th FOCS, 1991, pp. 576\u2013585.","DOI":"10.1109\/SFCS.1991.185422"},{"key":"10.1016\/S0304-3975(03)00426-2_BIB7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0020-0190(02)00313-7","article-title":"On the query complexity of finding a local maximum point","volume":"84","author":"Rastsvetaev","year":"2002","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(03)00426-2_BIB8","doi-asserted-by":"crossref","unstructured":"M. Santha, On the Monte Carlo boolean decision tree complexity of read-once formulae, in Sixth Ann. Conf. on Structure in Complexity Theory, 1991, pp. 180\u2013187.","DOI":"10.1109\/SCT.1991.160259"},{"key":"10.1016\/S0304-3975(03)00426-2_BIB9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02125350","article-title":"Query complexity or why is it difficult to separate NPA\u2229Co-NPA from PA by a random oracle","volume":"9","author":"Tardos","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(03)00426-2_BIB10","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1137\/0132073","article-title":"Discrete isoperimetric problems","volume":"32","author":"Wang","year":"1977","journal-title":"SIAM J. Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004262?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T17:08:44Z","timestamp":1734109724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503004262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503004262"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00426-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}