Pages that link to "Item:Q1867103"
From MaRDI portal
The following pages link to An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103):
Displayed 3 items.