The unbiased black-box complexity of partition is polynomial (Q460634)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6355004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The unbiased black-box complexity of partition is polynomial |
scientific article; zbMATH DE number 6355004 |
Statements
The unbiased black-box complexity of partition is polynomial (English)
0 references
13 October 2014
0 references
heuristic search
0 references
run-time analysis
0 references
evolutionary computation
0 references
0 references
0 references
0 references
0.84869534
0 references
0.8449717
0 references
0 references
0.84144926
0 references
0.84144926
0 references
0 references
0 references
