The Number of Transitivity Sets of Boolean Functions
- 1 September 1963
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Journal of the Society for Industrial and Applied Mathematics
- Vol. 11 (3) , 806-828
- https://doi.org/10.1137/0111059
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Generalization of polya’s fundamental theorem in enumerative combinatorial analysisIndagationes Mathematicae, 1959
- The Multipurpose Bias Device—Part II: The Efficiency of Logical ElementsIBM Journal of Research and Development, 1959
- On The Number of Symmetry Types of Boolean Functions of n VariablesCanadian Journal of Mathematics, 1953
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949
- Theory of monomial groupsTransactions of the American Mathematical Society, 1942
- Sur les types des propositions composéesThe Journal of Symbolic Logic, 1940
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937