Add to ORKGA general reasoning based on the lexicographic order is studied. It helps to create algorithms for generation of sets of words having some natural good properties. Several examples are considered and the performance of proposed algorithms cal-culated. An open combinatorial problem regarding the set of partitions arises
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
A given collection of sets has a natural partial order induced by the subset relation. Let the size ...
A large number of combinatorial structures can be specified using context free grammars. These gramm...
This thesis is about monomial orderings and a division algorithm for polynomials in two or more vari...
We consider producing permutations and combinations in lexicographical order. Except for the array t...
International audienceForcing lexicographical order in the solutions to an integer programming probl...
Abstract: In this paper the lexicographic decision process is presented in a unified way. We constru...
ABSTRACT. In this paper we are concerned with lexicographic products of ordered sets, which are much...
Automata and Dictionaries is aimed at students and specialists in natural language processing and re...
Internationally recognised researchers look at developing trends in combinatorics with applications ...
Automata and Dictionaries is aimed at students and specialists in natural language processing and re...
AbstractWe characterize trees whose lexicographic ordering produces an order isomorphic copy of some...
While classical Constraint Satisfaction Problems (shortly, CSPs) concern the search for the boolean ...
A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Dire...
Combinatorics on Words is a relatively new research topic in discrete math-ematics, mainly, but not ...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
A given collection of sets has a natural partial order induced by the subset relation. Let the size ...
A large number of combinatorial structures can be specified using context free grammars. These gramm...
This thesis is about monomial orderings and a division algorithm for polynomials in two or more vari...
We consider producing permutations and combinations in lexicographical order. Except for the array t...
International audienceForcing lexicographical order in the solutions to an integer programming probl...
Abstract: In this paper the lexicographic decision process is presented in a unified way. We constru...
ABSTRACT. In this paper we are concerned with lexicographic products of ordered sets, which are much...
Automata and Dictionaries is aimed at students and specialists in natural language processing and re...
Internationally recognised researchers look at developing trends in combinatorics with applications ...
Automata and Dictionaries is aimed at students and specialists in natural language processing and re...
AbstractWe characterize trees whose lexicographic ordering produces an order isomorphic copy of some...
While classical Constraint Satisfaction Problems (shortly, CSPs) concern the search for the boolean ...
A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Dire...
Combinatorics on Words is a relatively new research topic in discrete math-ematics, mainly, but not ...
AbstractRepresentation of permutations and combinations of N elements in lexicographical order by el...
A given collection of sets has a natural partial order induced by the subset relation. Let the size ...
A large number of combinatorial structures can be specified using context free grammars. These gramm...