120
click to vote
SPIRE
2010
Springer
15 years 14 days ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...