Algebraic methods for synthesizing majority gate networks

DOI10.1007/BF02576131MaRDI QIDQ2540165zbMATH OpenOpenAlexFDO

Authors Angelo Raffaele Meo

Publication date 1968

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02576131

zbMATH Keywords

computer science and automata

Cites work

• The 2's Complement and Other Semi-Systematic Binary Codes

This page was built for publication: Algebraic methods for synthesizing majority gate networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540165)