Buscar
Mostrando ítems 1-3 de 3
Ponencia
Designing rotating schedules by using Gröbner bases
(2013)
In the current paper, we deal with the problem of designing rotating schedules from an algebraic computational approach. Specifically, we determine a set of Boolean polynomials whose zeros can be uniquely ...
Artículo
Counting and enumerating feasible rotating schedules by means of Gröbner bases
(Elsevier, 2016)
This paper deals with the problem of designing and analyzing rotating schedules with an algebraic computational approach. Specifically, we determine a set of Boolean polynomials whose zeros can be uniquely identified with ...