"Why Large Closest String Instances Are Easy to Solve in Practice."

Christina Boucher, Kathleen P. Wilkie (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-16321-0_10

access: closed

type: Conference or Workshop Paper

metadata version: 2024-06-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/spire/BoucherW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spire/BoucherW10
Christina Boucher, Kathleen P. Wilkie:
Why Large Closest String Instances Are Easy to Solve in Practice. SPIRE 2010: 106-117

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.