Abstract
We study how many values of an unknown integer-valued function f one needs to know in order to find a local maximum of f. We consider functions defined on finite subsets of discrete plane. We prove upper bounds for functions defined on rectangles and present lower bounds for functions defined on arbitrary domains in terms of the size of the domain and the size of its border.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Impagliazzo, M. Naor. Decision Trees and Downward Closures, Third Annual Conference on Structure in Complexity Theory, pp. 29–38, 1988.
D. Wang, P. Wang. Discrete isoperimetric problems. SIAM J. Appl.Math. vol. 32, pp 860–870, 1977.
M. Blum and R. Impagliazzo. General oracle and oracle classes. 28th Annual IEEE Symposium on Foundation of Computer Science, pp 118–126, 1987.
L. Beklemishev. On the induction schema for decidable predicates. Department of Philosophy, Utrecht University, Logic Group Preprint series, 2000.
M. Santha. On the Monte Carlo boolean decision tree complexity of read-once formulae. In 6th Annual Conference on Structure in Complexity Theory, pp 180–187, 1991.
A. Rastsvetaev and L. Beklemishev. On the query complexity of finding a local maximum point. Department of Philosophy, Utrecht University, Logic Group Preprint Series 206, 2000. To appear in Information Processing Letters.
G. Tardos. Query complexity or why is it difficult to separate NPA ∩ Co-NPA from PA by a random oracle. Combinatorica, 9:385–392, 1990. On the Complexity of Finding a Local Maximum of Functions 211
L. Lovasz, M. Naor, I. Newman, A. Wigderson. Search problems in the decision tree model. 32th FOCS, pp 576–585, 1991.
J. Kiefer. Sequential minimax search for a maximum. Proc. Amer. Math. Soc., 4, pp 502–506, 1953.
P. Crescenzi, R. Silvestri. Sperner’s lemma and Robust Machines. Eighth annual structure in complexity theory conference, pp 194–199, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mityagin, A. (2003). On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_19
Download citation
DOI: https://doi.org/10.1007/3-540-36494-3_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00623-7
Online ISBN: 978-3-540-36494-8
eBook Packages: Springer Book Archive