๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The group-theoretic complexity of subsemigroups of boolean matrices

โœ Scribed by K.H. Kim; F.W. Roush


Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
486 KB
Volume
25
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Reduced Idempotents in the Semigroup of
โœ Janusz Konieczny ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 368 KB

We present an algorithm that generates all reduced idempotents in the semigroup of \(n \times n\) Boolean matrices. As a consequence, we obtain a method of listing all partial order relations on a finite set with \(n\) elements.

The complexity of two group scheduling p
โœ Jacek Blazewicz; Mikhail Y. Kovalyov ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 94 KB

The problems of scheduling groups of jobs under the group technology assumption are studied. The two remaining open questions posed in the literature a decade ago about the computational complexity of these problems (J. Oper. Res. Soc., 1992; 43:395 -406), are answered. The parallel machine problem