Login / Signup
On the complexity of finding a local maximum of functions on discrete planar subsets.
Anton Mityagin
Published in:
Theor. Comput. Sci. (2004)
Keyphrases
</>
space complexity
computational complexity
databases
information systems
computational cost
ground plane
machine learning
genetic algorithm
website
worst case
memory requirements
finite number
maximum number
continuous functions
discrete version