"Can You Solve Closest String Faster than Exhaustive Search?"

Amir Abboud et al. (2023)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2305.16878

access: open

type: Informal or Other Publication

metadata version: 2024-10-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2305-16878
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2305-16878
Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier:
Can You Solve Closest String Faster than Exhaustive Search? CoRR abs/2305.16878 (2023)

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.