Complexity Theory for Discrete Black-Box Optimization Heuristics
- DOI
- 10.1007/978-3-030-29414-4_3
- Published
- 2019-11-21
- Container
- Not recorded
- Publisher
- Not recorded
- Open access
- yes
Credibility signals
limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- supportingOpen access status: Normalized open-access status: open.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.1007/978-3-030-29414-4_3,
title = {Complexity Theory for Discrete Black-Box Optimization Heuristics},
author = {Carola Doerr},
year = {2019},
doi = {10.1007/978-3-030-29414-4_3},
url = {https://doi.org/10.1007/978-3-030-29414-4_3}
}RIS
TY - JOUR TI - Complexity Theory for Discrete Black-Box Optimization Heuristics AU - Carola Doerr PY - 2019 DO - 10.1007/978-3-030-29414-4_3 UR - https://doi.org/10.1007/978-3-030-29414-4_3 ER -
APA
Doerr, C. (2019). Complexity Theory for Discrete Black-Box Optimization Heuristics. https://doi.org/10.1007/978-3-030-29414-4_3
Source records
- hal · retrieved 2026-09-25T13:03:40.240Z