Can You Solve Closest String Faster Than Exhaustive Search?

Amir Abboud Nick Fischer Elazar Goldenberg Karthik C. S.Ron Safier

Published in: ESA (2023)

Keyphrases

exhaustive search
dynamic programming
computational complexity
closest string
brute force
computationally feasible
search methods
solution space
nearest neighbor search
lower bound
search space
simulated annealing
neural network
multi class