Skip to main content
SpringerLink
Log in

On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets

  • Conference paper
  • First Online:
STACS 2003 (STACS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2607))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Impagliazzo, M. Naor. Decision Trees and Downward Closures, Third Annual Conference on Structure in Complexity Theory, pp. 29–38, 1988.

    Google Scholar 

  2. D. Wang, P. Wang. Discrete isoperimetric problems. SIAM J. Appl.Math. vol. 32, pp 860–870, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. Blum and R. Impagliazzo. General oracle and oracle classes. 28th Annual IEEE Symposium on Foundation of Computer Science, pp 118–126, 1987.

    Google Scholar 

  4. L. Beklemishev. On the induction schema for decidable predicates. Department of Philosophy, Utrecht University, Logic Group Preprint series, 2000.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. 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

    Article  MathSciNet  Google Scholar 

  8. L. Lovasz, M. Naor, I. Newman, A. Wigderson. Search problems in the decision tree model. 32th FOCS, pp 576–585, 1991.

    Google Scholar 

  9. J. Kiefer. Sequential minimax search for a maximum. Proc. Amer. Math. Soc., 4, pp 502–506, 1953.

    Google Scholar 

  10. P. Crescenzi, R. Silvestri. Sperner’s lemma and Robust Machines. Eighth annual structure in complexity theory conference, pp 194–199, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Weizmann Institute of Science, 76100, Rehovot, Israel

    Anton Mityagin

Authors
  1. Anton Mityagin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Freie Universität Berlin, Takusstr. 9, 14195, Berlin, Germany

    Helmut Alt

  2. LIRMM, 161, Rue Ada, 34392, Montpellier Cedex 5, France

    Michel Habib

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation