The complexity of the representation of multiple-output Boolean functions
From MaRDI portal
Recommendations
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits
- scientific article; zbMATH DE number 2163011
- Multiplicative complexity of some Boolean functions
- An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
- On the multiplicative complexity of Boolean functions
Cites work
Cited in
(11)- Behavior of Shannon functions for complexity of parametric representations of Boolean functions
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
- scientific article; zbMATH DE number 3868606 (Why is no real title available?)
- Complexity of Boolean functions' representations in classes of extended pair-generated operator forms
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits
- The complexity of the descriptiveness of Boolean circuits over different sets of gates
- Enumeration of reversible functions and its application to circuit complexity
- A finite alternation result for reversible Boolean circuits
- An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
- Algebras of binary isolating formulas
- scientific article; zbMATH DE number 2163011 (Why is no real title available?)
This page was built for publication: The complexity of the representation of multiple-output Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q332335)