MINIMIZATION OF REPRESENTATIONS OF THE LOGICAL FUNCTION IN SCHAEFFER AND PIERCE BASES
From MaRDI portal
Recommendations
- Minimization of Boolean functions in the basis OR-NOT (AND-NOT)
- Complexity of realization of a linear Boolean function in Sheffer's basis
- Minimization of Exclusive or and Logical Equivalence Switching Circuits
- scientific article; zbMATH DE number 4089620
- On minimal realizations of linear Boolean functions
Cited in
(3)
This page was built for publication: MINIMIZATION OF REPRESENTATIONS OF THE LOGICAL FUNCTION IN SCHAEFFER AND PIERCE BASES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058143)