Pages that link to "Item:Q1801675"
From MaRDI portal
The following pages link to On the deterministic complexity of searching local maxima (Q1801675):
Displaying 9 items.
- Condition number based complexity estimate for computing local extrema (Q1026449) (← links)
- Dividing and conquering the square (Q1801677) (← links)
- On the query complexity of finding a local maximum point. (Q1853165) (← 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)
- Query complexity of approximate equilibria in anonymous games (Q2403236) (← links)
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima (Q4032937) (← links)
- Local Search for Max-Sum Diversification (Q4575743) (← links)
- Search for the maximum of a random walk (Q4697818) (← links)