On the complexity of finding a local maximum of functions on discrete planar subsets (Q1884980)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of finding a local maximum of functions on discrete planar subsets |
scientific article; zbMATH DE number 2111062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding a local maximum of functions on discrete planar subsets |
scientific article; zbMATH DE number 2111062 |
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
