256 search results - page 2 / 52 » Recursive Lattice Reduction |
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...
LICS
1997
IEEE
13 years 8 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
DMIN
2006
13 years 6 months ago
2006
This paper presents enhancements to previous algorithms for the sequential extraction of complete non-redundant set of rules from a concept lattice. The aim of these enhancements i...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...