Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
From MaRDI portal
Publication:3745772
integer programming logic designminimum networksNAND gatesNOR gatesparity functionssingle-rail input logic
Recommendations
Cited in
(17)- The complexity of the parity function in unbounded fan-in, unbounded depth circuits
- Order of state functions and logic functions
- Complexity and structure of circuits for parity functions
- Lower bound of circuit complexity of parity function in a basis of unbounded fan-in
- On the synthesis of NAND or NOR networks having multi-level
- Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements
- Minimal feedforward parity networks using threshold gates
- scientific article; zbMATH DE number 998407 (Why is no real title available?)
- Parallel Binary Adders with a Minimum Number of Connections
- Parallel multipliers with NOR gates based on G-minimum adders
- scientific article; zbMATH DE number 3906401 (Why is no real title available?)
- Inverter-Minimum Networks
- Properties of Wired Logic
- scientific article; zbMATH DE number 30276 (Why is no real title available?)
- scientific article; zbMATH DE number 910735 (Why is no real title available?)
- Characterization of all optimal networks for a simultaneous computation of AND and NOR
- Optimization of multiple-output exclusive-or logic circuits
This page was built for publication: Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745772)