"Achieving Tight O(4k) Runtime Bounds on Jumpk by ..."

Andre Opris, Johannes Lengler, Dirk Sudholt (2025)

> Home

Details and statistics

DOI: 10.1007/S00453-025-01323-X

access: closed

type: Journal Article

metadata version: 2025-10-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/OprisLS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/OprisLS25
Andre Opris, Johannes Lengler, Dirk Sudholt:
Achieving Tight O(4^k) Runtime Bounds on Jump_k by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity. Algorithmica 87(11): 1564-1619 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.