Hardness of the Covering Radius Problem on Lattices.

Ishay Haviv Oded Regev

Published in: Computational Complexity Conference (2006)

Keyphrases

computational complexity
phase transition
np complete
information theoretic
decision trees
evolutionary algorithm
np hard
worst case
learning theory
information retrieval
artificial intelligence
computer vision
multiscale
np hardness
circular arcs