Introduces matched composition for generalized number lattices with implicit inversion and duality theorems, enabling self-dual lattice construction and reduced basis algorithms when inputs have totally unimodular bases.
Regev, Lattices in computer science, Lecture notes of a course given in Tel Aviv University (2004)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the linking of number lattices
Introduces matched composition for generalized number lattices with implicit inversion and duality theorems, enabling self-dual lattice construction and reduced basis algorithms when inputs have totally unimodular bases.