|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 21 of 29 found articles
| Title: |
On the complexity of finding a local maximum of functions on discrete planar subsets |
| Author: |
Mityagin, Anton |
| Appeared in: |
Theoretical computer science |
| Paging: | Volume 310 (2004) nr. 1-3 pages 9 p. |
| Year: |
2004 |
| Contents: | |
| Publisher: |
Elsevier B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 21 of 29 found articles
| << previous | next >> |
Toegankelijkheidsverklaring