Pages that link to "Item:Q1884980"
From MaRDI portal
The following pages link to On the complexity of finding a local maximum of functions on discrete planar subsets (Q1884980):
Displaying 4 items.
- On the deterministic complexity of searching local maxima (Q1801675) (← links)
- Dividing and conquering the square (Q1801677) (← links)
- On the query complexity of finding a local maximum point. (Q1853165) (← links)
- Chaos and Shadowing Around a Heteroclinically Tubular Cycle With an Application to Sine‐Gordon Equation (Q3528879) (← links)