Decomposition of Boolean functions
From MaRDI portal
Recommendations
- The complexity of modular decomposition of Boolean functions
- A new approach to the decomposition of Boolean functions. IV. Non-disjoint decomposition: the method of p,q-partitions
- scientific article; zbMATH DE number 2227354
- A new approach to the decomposition of Boolean functions by the method of \(q\)-partitions. II. Repeated decomposition
- On linear decomposition of Boolean functions
Cited in
(17)- Pivotal decompositions of functions.
- scientific article; zbMATH DE number 4021162 (Why is no real title available?)
- Join-irreducible Boolean functions
- scientific article; zbMATH DE number 2059953 (Why is no real title available?)
- scientific article; zbMATH DE number 2033418 (Why is no real title available?)
- Decision lists and related Boolean functions
- scientific article; zbMATH DE number 3865355 (Why is no real title available?)
- scientific article; zbMATH DE number 597624 (Why is no real title available?)
- scientific article; zbMATH DE number 1931923 (Why is no real title available?)
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- AND-decomposition of Boolean polynomials with prescribed shared variables
- Decomposition of systems of Boolean functions determined by binary decision diagrams
- The complexity of AND-decomposition of Boolean functions
- A new approach to the decomposition of Boolean functions by the method of \(q\)-partitions. II. Repeated decomposition
- scientific article; zbMATH DE number 7650336 (Why is no real title available?)
- The complexity of modular decomposition of Boolean functions
- Linear decomposition of Boolean functions into a sum or a product of components
This page was built for publication: Decomposition of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081619)
