| Information | |
|---|---|
| has gloss | eng: In theoretical computer science, CLOSEST STRING is the name of an NP-hard computational problem, which tries to find the geometrical center of a set of input strings. |
| lexicalization | eng: Closest string |
| instance of | e/NP-complete |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint