"Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling ..."

Andrew M. Sutton, Carsten Witt (2021)

> Home

Details and statistics

DOI: 10.1007/S00453-020-00776-6

access: closed

type: Journal Article

metadata version: 2021-11-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/SuttonW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/SuttonW21
Andrew M. Sutton, Carsten Witt:
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. Algorithmica 83(10): 3180-3208 (2021)

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.