Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Evgeni Begelfor"'
Publikováno v:
Groups Complexity Cryptology. 7
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of non-abelian analog