The Number of Classes of Invertible Boolean Functions

DOI10.1145/321150.321152MaRDI QIDQ5331459zbMATH OpenOpenAlexFDO

Authors Michael A. Harrison

Publication date 1963

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027.42/5402

zbMATH Keywords

mathematical logic

Cited in

(7)

• Computing the number of the equivalence classes for reversible logic functions
• The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
• On the number of classes of (n,k) switching networks
• Affine equivalency and nonlinearity preserving bijective mappings over \(\mathbb {F}_2\)
• Enumeration of reversible functions and its application to circuit complexity
• Equivalence classes of invertible Boolean functions
• New Results on Reversible Boolean Functions Having Component Functions with Specified Properties

This page was built for publication: The Number of Classes of Invertible Boolean Functions

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