Enumerating Types of Boolean Functions
From MaRDI portal
Publication:3398615
Recommendations
Cites work
- scientific article; zbMATH DE number 3148267 (Why is no real title available?)
- scientific article; zbMATH DE number 3869218 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- scientific article; zbMATH DE number 1516969 (Why is no real title available?)
- scientific article; zbMATH DE number 3313249 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- A Course in Enumeration
- Enumeration under two representations of the wreath product
- Exponentiation of Permutation Groups
- Hipparchus, Plutarch, Schroder, and Hough
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- ON FACTORING JEVONS' NUMBER
- On The Number of Symmetry Types of Boolean Functions of n Variables
- On the Second Number of Plutarch
- On the cycle index of a product of permutation groups
- On the number of bi-colored graphs
- On the number of classes of (n,k) switching networks
- On the shoulders of Hipparchus. A reappraisal of ancient Greek combinatorics
- Sur les types des propositions composées
- The Number of Transitivity Sets of Boolean Functions
- Überprüfung einer frühen Anwendung der Kombinatorik in der Logik
Cited in
(4)
This page was built for publication: Enumerating Types of Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3398615)