On the complexity of finding a local maximum of functions on discrete planar subsets (Q1884980)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding a local maximum of functions on discrete planar subsets |
scientific article |
Statements
On the complexity of finding a local maximum of functions on discrete planar subsets (English)
0 references
27 October 2004
0 references
Computational complexity
0 references
Decision trees
0 references
Local maximum search
0 references
0 references
