Add to ORKGABSTRACT. A lattice in euclidean space which is an orthogonal sum of nontrivial sublattices is called decomposable. We present an algorithm to construct a lattice’s decomposition into indecomposable sublattices. Similar methods are used to prove a covering theorem for generating systems of lattices and to speed up variations of the LLL algorithm for the computation of lattice bases from large generating systems. 1
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
A lattice in euclidean space which is an orthogonal sum of nontrivial sublattices is called decompo...
Let D be a distributive lattice formed by subsets of a finite set E such that Ø,E∈D, with set union ...
The notion of decomposable topology is introduced in a partially ordered set, and in particular in t...
The notion of decomposable topology is introduced in a partially ordered set, and in particular in t...
The notion of decomposable topology is introduced in a partially ordered set, and in particular in t...
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as so...
Let a tile be defined as a non-empty subset of the integers. The concept of decomposable coverings a...
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size...
AbstractWe present several efficient algorithms on distributive lattices. They are based on a compac...
A polynomial time algorithm is presented that given a rational approximation to a lattice in real n-...
International audienceWe present a lattice algorithm specifically designed for some classical applic...
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
A lattice in euclidean space which is an orthogonal sum of nontrivial sublattices is called decompo...
Let D be a distributive lattice formed by subsets of a finite set E such that Ø,E∈D, with set union ...
The notion of decomposable topology is introduced in a partially ordered set, and in particular in t...
The notion of decomposable topology is introduced in a partially ordered set, and in particular in t...
The notion of decomposable topology is introduced in a partially ordered set, and in particular in t...
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as so...
Let a tile be defined as a non-empty subset of the integers. The concept of decomposable coverings a...
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size...
AbstractWe present several efficient algorithms on distributive lattices. They are based on a compac...
A polynomial time algorithm is presented that given a rational approximation to a lattice in real n-...
International audienceWe present a lattice algorithm specifically designed for some classical applic...
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
The LLL algorithm is recognized as one of the most important achievements of twentieth century with ...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...
AbstractThis paper introduces the framework of decomposable combinatorial structures and their trave...