A new theorem in threshold logic and its application to multioperand binary adders
From MaRDI portal
Publication:4467334
DOI10.1080/00207160310001603262zbMath1043.94550OpenAlexW2020610525WikidataQ58137887 ScholiaQ58137887MaRDI QIDQ4467334
Alfonso Gago Bohórquez, Javier López García, Santiago Cárdenas Martín, José Fernández Ramos
Publication date: 9 June 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160310001603262
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- The complexity of computing symmetric functions using threshold circuits
- Approximating threshold circuits by rational functions
- Parity, circuits, and the polynomial-time hierarchy
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Simulating Threshold Circuits by Majority Circuits
This page was built for publication: A new theorem in threshold logic and its application to multioperand binary adders