On the complexity of finding a local maximum of functions on discrete planar subsets (Q1884980): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(03)00426-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028456923 / rank | |||
Normal rank | |||
Latest revision as of 11:06, 30 July 2024
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
