On the minimization of Boolean functions for additive complexity measures
From MaRDI portal
Publication:4973262
Recommendations
- On minimal complexes of faces in the unit cube
- On a minimization problem for a set of Boolean functions
- On complexity measures of complexes of faces in the unit cube
- On the relation between the irredundant and minimal complexes of faces in the unit cube.
- Minimal complexes of faces of a random Boolean function.
Cites work
- scientific article; zbMATH DE number 4089620 (Why is no real title available?)
- scientific article; zbMATH DE number 3700729 (Why is no real title available?)
- On a minimization problem for a set of Boolean functions
- On complexity measures of complexes of faces in the unit cube
- On the complexity of minimizing quasicyclic Boolean functions
- The shortest disjunctive normal form of a random Boolean function
Cited in
(5)- On a minimization problem for a set of Boolean functions
- Primitivity, uniform minimality, and state complexity of Boolean operations
- Geometry of translations on a Boolean cube
- Proof of covering minimality by generalizing the notion of independence
- On the complexity of minimizing quasicyclic Boolean functions
This page was built for publication: On the minimization of Boolean functions for additive complexity measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973262)
