The Unbiased Black-box Complexity of Partition is Polynomial

Doerr, Benjamin; Doerr, Carola; Kötzing, Timo

doi:10.1016/j.artint.2014.07.009

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

The Unbiased Black-box Complexity of Partition is Polynomial

MPS-Authors

/persons/resource/persons44338

Doerr, Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45750

Doerr, Carola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44814

Kötzing, Timo
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

Link
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Doerr, B., Doerr, C., & Kötzing, T. (2014). The Unbiased Black-box Complexity of Partition is Polynomial. Artificial Intelligence, 216, 275-286. doi:10.1016/j.artint.2014.07.009.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4264-2

Abstract

There is no abstract available