The Number of Transitivity Sets of Boolean Functions
From MaRDI portal
Publication:5730124
DOI10.1137/0111059zbMath0119.01202OpenAlexW2065321712MaRDI QIDQ5730124
Publication date: 1963
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0111059
Related Items (6)
On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers ⋮ Enumeration of Reversible Functions and Its Application to Circuit Complexity ⋮ Balancing the \(n\)-cube: A census of colorings ⋮ On the number of classes of (n,k) switching networks ⋮ Low-dimensional representation of genomic sequences ⋮ Enumerating Types of Boolean Functions
This page was built for publication: The Number of Transitivity Sets of Boolean Functions
