✦ LIBER ✦

The Number of Transitivity Sets of Boolean Functionsby Michael A. Harrison;The Number of Equivalence Classes of Boolean Functions under Groups Containing negationby Michael A. Harrison;On the Number of Classes of (n, k) Switching Networksby Michael A. Harrison;The Number of Classes of Invertible Boolean Functionsby Michael A. Harrison

✍ Scribed by Review by: J. Kuntzmann

Book ID: 124972017
Publisher: Association for Symbolic Logic
Year: 1970
Tongue: English
Weight: 352 KB
Volume: 35
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2271222

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Number of Equivalence Classes of Boo

The Number of Equivalence Classes of Boolean Functions Under Groups Containing Negation

✍ Harrison, Michael A. 📂 Article 📅 1963 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 664 KB

On the number of classes of (n,k) switch

On the number of classes of (n,k) switching networks

✍ Michael A. Harrison 📂 Article 📅 1963 🏛 Elsevier Science 🌐 English ⚖ 588 KB

An (n,k) switching network is defined as all n-input, k-output network such that associated with each output is a Boolean transmission function of the n-inputs. If we allow a group @ on the inputs and a group ~ on the outputs, then the family of networks is decomposed into equivalence classes. In th

On the number of equivalence classes of

On the number of equivalence classes of Boolean functions under a transformation group (Corresp.)

✍ Denev, J.; Tonchev, V. 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 312 KB