A new theorem in threshold logic and its application to multioperand binary adders
From MaRDI portal
Publication:4467334
Recommendations
- scientific article; zbMATH DE number 2033213
- 2-1 addition and related arithmetic operations with threshold logic
- Some notes on threshold circuits, and multiplication in depth 4
- Shallow circuits and concise formulae for multiple addition and multiplication
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
Cites work
- Approximating threshold circuits by rational functions
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Parity, circuits, and the polynomial-time hierarchy
- Simulating Threshold Circuits by Majority Circuits
- The complexity of computing symmetric functions using threshold circuits
Cited in
(6)- Malyugin's theorems: A new concept in logical control, VLSI design, and data structures for new technologies
- Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345
- A New Operator for Multi-addition Calculations
- scientific article; zbMATH DE number 2033213 (Why is no real title available?)
- Two operand binary adders with threshold logic
- The p-valued-input, q-valued-output threshold logic and its application to the synthesis of p-valued logical networks
This page was built for publication: A new theorem in threshold logic and its application to multioperand binary adders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4467334)