Can you solve closest string faster than exhaustive search? (Q6656939)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Can you solve closest string faster than exhaustive search? |
scientific article; zbMATH DE number 7961848
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can you solve closest string faster than exhaustive search? |
scientific article; zbMATH DE number 7961848 |
Statements
Can you solve closest string faster than exhaustive search? (English)
0 references
6 January 2025
0 references
closest string
0 references
fine-grained complexity
0 references
SETH
0 references
inclusion-exclusion
0 references
