✦ 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
DOI: 10.1016/0024-3795(79)90024-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Primes in the semigroup of Boolean matri

Primes in the semigroup of Boolean matrices

✍ D. de Caen; D.A. Gregory 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 938 KB

Reduced Idempotents in the Semigroup of

Reduced Idempotents in the Semigroup of Boolean Matrices

✍ 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.

Group-theoretic constraints on the struc

Group-theoretic constraints on the structure of the class group

✍ Gary Cornell; Michael Rosen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 584 KB

On the maximal subgroup of the semigroup

On the maximal subgroup of the semigroup of generalized circulant Boolean matrices

✍ Mou-Cheng Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 773 KB

Graph theoretic aspects of maximizing th

Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices

✍ Shaun Fallat; D.D. Olesky; P. van den Driessche 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

The complexity of two group scheduling p

The complexity of two group scheduling problems

✍ 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