Pages that link to "Item:Q1853165"
From MaRDI portal
The following pages link to On the query complexity of finding a local maximum point. (Q1853165):
Displaying 6 items.
- Operations research applications of dichotomous search (Q1681128) (← links)
- On the deterministic complexity of searching local maxima (Q1801675) (← links)
- Dividing and conquering the square (Q1801677) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- On the complexity of finding a local maximum of functions on discrete planar subsets (Q1884980) (← links)
- On the complexity of searching for a maximum of a function on a quantum computer (Q2491387) (← links)