An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note |
scientific article; zbMATH DE number 1891149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note |
scientific article; zbMATH DE number 1891149 |
Statements
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (English)
0 references
2 April 2003
0 references
unconstrained optimization
0 references
computational complexity
0 references
scheduling
0 references
0.7746075987815857
0 references
0.761943519115448
0 references
0.7559137940406799
0 references
0.7526050806045532
0 references
