Equivalence classes of invertible Boolean functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3745175 (Why is no real title available?)
- scientific article; zbMATH DE number 3583813 (Why is no real title available?)
- scientific article; zbMATH DE number 3595098 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3231901 (Why is no real title available?)
- Invertible Boolean Functions
- On the Classification of Boolean Functions by the General Linear and Affine Groups
- The Number of Classes of Invertible Boolean Functions
Cited in
(11)- Properties of reversible polynomial functions
- Universal affine classification of Boolean functions
- Reflectiveness and compression of threshold transformations
- Computing the number of the equivalence classes for reversible logic functions
- Enumeration of reversible functions and its application to circuit complexity
- Boolean Functions, Invariance Groups, and Parallel Complexity
- Enumerating Types of Boolean Functions
- scientific article; zbMATH DE number 3912285 (Why is no real title available?)
- On the number of bijunctive functions invariant with respect to a given permutation
- On the number of equivalence classes of invertible Boolean functions under action of permutation of variables on domain and range
- Invertible Boolean Functions
This page was built for publication: Equivalence classes of invertible Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3693449)