![](/img/cover-not-exists.png)
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note
T.C.E. Cheng, Mikhail Y. KovalyovVolume:
29
Year:
2002
Language:
english
Pages:
5
DOI:
10.1016/s0305-0548(02)00065-5
File:
PDF, 77 KB
english, 2002