Covering Radius Problem
Given a basis for the lattice, the algorithm must find the largest distance (or in some versions, its approximation) from any vector to the lattice.
Read more about this topic: Lattice Problem
Famous quotes containing the words covering and/or problem:
“You had to have seen the corpses lying there in front of the school—the men with their caps covering their faces—to know the meaning of class hatred and the spirit of revenge.”
—Alfred Döblin (1878–1957)
“A curious thing about the ontological problem is its simplicity. It can be put in three Anglo-Saxon monosyllables: ‘What is there?’ It can be answered, moveover, in a word—‘Everything.’”
—Willard Van Orman Quine (b. 1908)