The unbiased black-box complexity of partition is polynomial - Archive ouverte HAL Access content directly
Journal Articles Artificial Intelligence Year : 2014

The unbiased black-box complexity of partition is polynomial

Abstract

Unbiased black-box complexity was introduced as a refined complexity model for randomized search heuristics (Lehre and Witt (2012) [24]). For several problems, this notion avoids the unrealistically low complexity results given by the classical model of Droste et al. (2006) [10]. We show that for some problems the unbiased black-box complexity remains artificially small. More precisely, for two different formulations of an NP-hard subclass of the well-known Partition problem, we give mutation-only unbiased black-box algorithms having complexity O(nlog⁡n). This indicates that also the unary unbiased black-box complexity does not give a complete picture of the true difficulty of this problem for randomized search heuristics.

Dates and versions

hal-01086507 , version 1 (24-11-2014)

Identifiers

Cite

Benjamin Doerr, Carola Doerr, Timo Kötzing. The unbiased black-box complexity of partition is polynomial. Artificial Intelligence, 2014, 216, pp.12. ⟨10.1016/j.artint.2014.07.009⟩. ⟨hal-01086507⟩
216 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More