On the complexity of finding a local maximum of functions on discrete planar subsets

Anton Mityagin. On the complexity of finding a local maximum of functions on discrete planar subsets. Theoretical Computer Science, 310(1-3):355-363, 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.