Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
From MaRDI portal
(Redirected from Publication:255774)
Recommendations
- Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
- Complexity and structure of circuits for parity functions
- Complexity of implementation of parity functions in the ``implication-negation basis
- Complexity of linear and majority functions in the basis of antichain functions
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits
Cites work
- scientific article; zbMATH DE number 6460060 (Why is no real title available?)
- scientific article; zbMATH DE number 3358361 (Why is no real title available?)
- scientific article; zbMATH DE number 3422273 (Why is no real title available?)
- Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
- On minimal realizations of linear Boolean functions
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits
- Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
Cited in
(5)- The complexity of the parity function in unbounded fan-in, unbounded depth circuits
- Complexity of linear and majority functions in the basis of antichain functions
- scientific article; zbMATH DE number 3328172 (Why is no real title available?)
- Complexity and structure of circuits for parity functions
- Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
This page was built for publication: Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255774)
