The Number of Transitivity Sets of Boolean Functions

DOI10.1137/0111059MaRDI QIDQ5730124zbMATH OpenOpenAlexFDO

Authors Michael A. Harrison

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

zbMATH Keywords

mathematical logic

Cited in

(6)

• Low-dimensional representation of genomic sequences
• On the number of classes of (n,k) switching networks
• Enumeration of reversible functions and its application to circuit complexity
• Enumerating Types of Boolean Functions
• Balancing the \(n\)-cube: A census of colorings
• On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers

This page was built for publication: The Number of Transitivity Sets of Boolean Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5730124)