Complexity Theory for Discrete Black-Box Optimization Heuristics

Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01921037
Contributor : Carola Doerr <>
Submitted on : Tuesday, November 13, 2018 - 3:42:59 PM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

Identifiers

  • HAL Id : hal-01921037, version 1

Citation

Carola Doerr. Complexity Theory for Discrete Black-Box Optimization Heuristics. Theory of Randomized Search Heuristics in Discrete Search Spaces, In press. ⟨hal-01921037⟩

Share

Metrics

Record views

15