Approximating the Number of Error Locations within a Constant Ratio is NP-complete.

Published in: AAECC (1993)

Keyphrases

np complete
maximum number
computational complexity
small number
randomly generated
approximation error
polynomial time complexity
genetic algorithm
clustering algorithm
case study
np hard
upper bound
error probability